@atul I think he is asking for max. sum of elements between 2 leaf nodes and not the max distance between two nodes.
On Sun, Aug 26, 2012 at 6:12 PM, atul anand <atul.87fri...@gmail.com> wrote: > its the diameter of tree. > you can find implementation on geeksforgeeks > > On 8/25/12, kunal rustgi <rustogi.ku...@gmail.com> wrote: > > Hi, > > > > Can anyone suggest the best approach for finding max sum b/w 2 leaf nodes > > in a binary tree ( not BST ) ? > > > > -- > > 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 > > algogeeks+unsubscr...@googlegroups.com. > > 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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- .................................... *Regards *Ravi Maggon Member Technical - IT/Front Office D.E. Shaw & Co. -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
