I think this should work
void finddepth(Node *node,int depth){
if(node!=NULL){
depth = max( finddepth(node->left,depth+1),
finddepth(node->right,depth+1) );
}
return depth;
}
On Mon, Aug 8, 2011 at 6:33 PM, 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.
>
>
--
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.
