here's the program...:) http://geeksforgeeks.org/?p=646
On Mon, Aug 8, 2011 at 6:39 PM, Nitin Nizhawan <[email protected]>wrote: > > 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 <[email protected] > > 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 [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Anil Kumar Arya B.Tech III year computer science & engineering M.N.N.I.T Allahabad. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
