Finding depth of Binary Tree 1

[Seijuro]

I need help finding the depth of a binary tree. I want to run this after each insert and print out the depth. Any help would be appreciated. Can anyone give me some sample code that would do this or tell me how to do this??

 

[Salem]

if ( node == NULL ) {
  return 0;
} else {
  left_depth = depth(node->left);
  right_depth = depth(node->right);
  return 1 + max(left_depth,right_depth);
}

Easy

--

http://www.catb.org/~esr/faqs/smart-questions.html

 

[chipperMDW]

In English, return the greater of the depths of your left and right subtrees + 1. An empty subtree has depth zero.

Yes, it's recursive.

 

[lionelhill]

... which means it may or may not be what you want. If your tree is being built evenly, then the depth shouldn't vary by more than one whatever branch you follow. In which case you can follow a single branch and get the answer to within one, without any recursion or large-scale searching (which will happen if you search the whole tree recursively).
If the tree is not being built evenly, then the recursive version tells you the deepest bit.

Remember that a single insert can only change the depth by one. If you modify your insert function you can make it return the depth of insert. Otherwise every time you do the insert you will search the entire tree.