should be 2. -Cheers, Moheed "I am who I am, no matter where I am or who I am with." * *
On Sun, Mar 11, 2012 at 11:04 AM, rahul sharma <[email protected]>wrote: > http://www.geeksforgeeks.org/archives/646 > > Plz tell that the link i have given in this mail for tree height...isn't > the tree height is 2 in this???height is the longest path...n in path we > include the number of edges or nodes??acc. to me its number of edges in > longest path...plz tell..thnx in advance > > -- > 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.
