Two types of search are popular in Binary Tree. Breadth First Search (BFS) and Depth First Search (DFS) .
Printing the level order is slightly complex since you need to keep track of the height of the particular node to implement
the level order printing. Its a kind of BFS node tracking using the height.
Here is a c implementation of printing level order for a Binary Tree.
