CareerCup

bob you forgot to increment the depth as you travel down the tree

plus, I think the question was meant to ask the height of a tree. Depth is usually for some node in the tree.

int getHeight(struct treeNode *tree) {

if(tree == NULL) {
return 0;
}
leftHeight = getHeight(tree->left);
rightHeight = getHeight(tree->right);

if(leftHeight > rightHeight) {

return (leftHeight+1);
}
else {
return (rightHeight+1);
}
}

return depth(root->left)>depth(root->right)?
depth(root->left)+1:depth(root->right)+1

Question does not say binary tree... could it be a tree with >2 children?

If binary tree, its simple

int Height(Node *root)
{
if( !root ) return 0;

return 1 + max( Height(root->left), Height(root->right) );
}

int Max(int a, int b)
{
return (a > b)? a : b;
}

If binary tree, its simple

int Height(Node *root)
{
   if( !root ) 
      return 0;

   return 1 + max( Height(root->left), Height(root->right) );
}

int Max(int a, int b)
{
   return (a > b)? a : b;
}