/* RECURSIVELY */
mynode *searchtree(mynode *root, int value){
if(root -> data == value)
return root;
if(value > root -> data)
return (searchtree(root -> right, value));
if(value < root -> data)
return (searchtree(root -> left, value));
}

——————-7

——–5                  10

4          6        9          11

then its level order traversal would be

7     5    10      4      6        9      11

Using queue we can do the traversal, here is the some working C code:

——————————————————————————————————————-

void levelorderTraversal(mynode *root){
mynode *queue[100] = {(mynode *)0};
int queue_number, size;
queue_number = size = 0;
while(root){
printf(“%2d”, root -> data);
if(root -> left)
queue[size++] = root -> left;
if(root -> right)
queue[size++] = root -> right;
root = queue[queue_number++];
}
}