@navin
it is not necessary that path b/w two leaves always pass thru root.
On Wed, Aug 29, 2012 at 1:15 AM, Navin Gupta navin.nit...@gmail.com wrote:
I think the path between two leaves always passes thru root.
Now we can keep track of root-to-leaf path whose sum is max and secondMax
among
distance between two nodes.
On Sun, Aug 26, 2012 at 6:12 PM, atul anand atul.87fri...@gmail.comwrote:
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
, 2012 at 11:46 PM, kunal rustgi rustogi.ku...@gmail.comwrote:
@ravi
yep, you're right.
But method is similar to finding diameter as given on geeksforgeeks as
atul suggested . Thanks.
On Mon, Aug 27, 2012 at 11:23 PM, Ravi Maggon maggonr...@gmail.comwrote:
@atul:
I think he is asking for max
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
