MadeEasy Test Series :Programming & DS - Binary Treee

Question

int find(Struct Node *root){

int a = 0, b = 0, c = 0;
if(root == NULL) return 0;
if(root-->left == NULL && root--->right == NULL) return 1;
else
a = find(root--->left);
b = find(root--->right);
c = 1 + max(a,b);
return c;
}

What does the above code find?

a) #levels

b) height of a rooted tree

Comments

levels....

number of levels..

---

level try with single node it will give 1