int depth(node *root)
{
return root ? 1+max(depth(root->left), depth(root->right)) : 0;
}
On Aug 8, 8:03 am, jagrati verma <jagrativermamn...@gmail.com> wrote:
> finding the depth or height of a tree.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
