getHt(node *n)
> {
> if (n)
return ( max(getHt(n->left) + 1, getHt(n->right) +1);
else
return 0;
}
>
> On 4/16/07, Virag Dhulia <[EMAIL PROTECTED]> wrote:
> >
> > HI Experts,
> >
> > I want to calculate the height of a binary tree recursively, any help
> > will be appreciated
> >
> > --
> > A man with dreams is never alone
> > > >
> >
>
--~--~---------~--~----~------------~-------~--~----~
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 [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
