do u meand diameter of tree?? if it is so then start from the left most node in tree and traverse upto root and traverse to the rightmost node in tree..this u can do by having extra field in tree which is parent pointer....
On Fri, Jun 18, 2010 at 4:25 AM, Anand <[email protected]> wrote: > Any guys suggest any algo on how to find the width of the 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- yezhu malai vaasa venkataramana Govinda Govinda -- 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.
