CareerCup

int depth(node* root)
{
if(!root)
return -1;
return max(depth(root->left),depth(root->right))+1;
}

Hi AD. Can you please tell me what is wrong with my solution?

yes..winia solution is right..thats the most efficient way.

Just find height of a tree

@ Lakshmi: Your solution is just a BS. I've never seen such shitty codes for such simple question.

The question is just to find the height of the tree and nothing else.
winia's solution is the standard way to doing it.

int max_deapth(node root){
int ld=0,rd=0,maxd=0;
node cur;

cur=root;

if(!root){
return maxd;
}

if(cur->left){

while(cur->left){
ld++;
cur=cur->left;
}
}

if(cur->right){
while(cur->right){
rd++;
cur=cur->right;
}
}

maxd = (rd > ld ? rd : ld);

return maxd+1;
}