This document provides a C function to find the level of a given node in a binary tree. The function accepts a pointer to the root of the binary tree and the target node, and recursively traverses the tree by comparing the target node to the current node and incrementing the height. It returns the height at which the target node is found, or -1 if the target node is not in the tree.

1. Binary Trees in C
Write a C function that accepts a pointer to a binary tree and a pointer to a node of the tree and
returns the level of the node in the tree.
Solution
Answer:
sturct binarytreenode {
int data;
struct binarytreenode *left;
struct binarytreenode *right;
}
int find(struct binarytreenode *tree, struct binarytreenode *u, int height)
{
int leftheight,rightheight;
if(tree==NULL)
return(-1);
if(tree==u)
return(height);
leftheight=find(tree->left,u,height+1);
if (leftheight != -1)
return(leftheight);
else
return(find(tree->right,u,height+1));
}
main()
{
struct binarytreenode *root, *u
height(root, u, 0);
}