[algogeeks] Re: suggest simple code for

2011-08-10 Thread Don
I do love functions that start with "return". Don On Aug 10, 10:09 am, Dave wrote: > @Don: Beautiful! > > Dave > > On Aug 10, 10:03 am, Don wrote: > > > int depth(node *root) > > { > >   return root ? 1+max(depth(root->left), depth(root->right)) : 0; > > > } > > > On Aug 8, 8:03 am, jagrati verm

[algogeeks] Re: suggest simple code for

2011-08-10 Thread Dave
@Don: Beautiful! Dave On Aug 10, 10:03 am, Don wrote: > int depth(node *root) > { >   return root ? 1+max(depth(root->left), depth(root->right)) : 0; > > } > > On Aug 8, 8:03 am, jagrati verma wrote: > > > > >  finding the depth or height of a tree. -- You received this message because you ar

[algogeeks] Re: suggest simple code for

2011-08-10 Thread Don
int depth(node *root) { return root ? 1+max(depth(root->left), depth(root->right)) : 0; } On Aug 8, 8:03 am, jagrati verma 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 gr

[algogeeks] Re: suggest simple code for

2011-08-10 Thread Don
int depth(node *root) { return root ? max(depth(root->left), depth(root->right)) : 0; } On Aug 8, 8:03 am, jagrati verma 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 grou