Thread: Find level of an element in a tree

Write a c program to search for an element in a binary tree[not BST] and if found return its level. root is labelled level 0 and children are one level incremented than its parent.
if not found return -1

Code:

int findLevel(TREE * t, int& levelCount, int data)
{
	int left,right,temp;
	if(!t)
		return -1;
	if(t->data == data ) {
		levelCount=0;
		return 1;
	} else {
		left=findLevel(t->left,levelCount,data);
		right= findLevel(t->right,levelCount,data);
		temp=(left == -1 ) ? right: left;
		levelCount++;
		return temp;
	}
}