CareerCup

Do a depth first traversal and keep on increasing parents height as rolling out of the recursion.

dft is a soln but without dft recursive simple solution exists.

typedef struct node * NODE;

int depth ( NODE nd )
{
return nd?1 + max ( depth ( nd ->left ) , depth ( nd ->right ) ):-1;
}

for height of tree just change -1 in code to 0;

int maxdeepth(Node *root)
{
if (root == NULL)
return 0
}
else
{
return (1 + max(maxdeepth(root->left),maxdeepth(x->right)));
}

i think the code is correct but not optimized , for optimization we will have to use dynamic programming.check MIT open courseware dynamic programming.