int maxLtoLSum(NODE *root,int *sum)
{
int ls=0,rs=0,lsum=0,rsum=0;
if(root==NULL)
{
*sum=0;
return 0;
}
lsum= maxLtoLSum (root->left,&ls);
rsum= maxLtoLSum (root->right,&rs);
*sum=max(ls,rs) + root->data;
return max(ls + rs + root->data, max(lsum,rsum));
}
On Tue, Aug 28
@vaibhav-yup :-)
--
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 t
Hope This will Work..
int Recursion(node *root)
{
if(root->left==Null&&root->right==Null)
{
return root->data;
}
int a=0,b=0;
a=recursion(root->left);
b=recursion(root->right);
if(a+b+root->data>max)
max=a+b+root->data;
return max(a,b)+root->data;
}
--
You received this message because you are s
I guess it might be
finding maximum sum path for left subtree + max sum path for right subtree
+ root->data
As in case of finding the diameter which say
height(root->left)+height(root->right)+1
Please correct me!
On Mon, Aug 27, 2012 at 11:46 PM, kunal rustgi wrote:
> @ravi
> yep, you're right
@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 wrote:
> @atul:
> I think he is asking for max. sum of elements between 2 leaf nodes and not
> the max distance between two node
> So, how do you do that sir?
>>
> Basically , we should identify all the paths between those two nodes and
keep track of maximum of sums.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https:
@Ravi: That is also my understanding, so the solution involves traversing
the tree and keeping track of the values of the two largest leaf nodes.
Dave
On Monday, August 27, 2012 12:53:05 PM UTC-5, Ravi Maggon wrote:
> @atul
> I think he is asking for max. sum of elements between 2 leaf nodes a
@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 wrote:
> its the diameter of tree.
> you can find implementation on geeksforgeeks
>
> On 8/25/12, kunal rustgi wrote:
> > Hi,
> >
> >
its the diameter of tree.
you can find implementation on geeksforgeeks
On 8/25/12, kunal rustgi 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
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 fro
10 matches
Mail list logo
