/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int maxSum(TreeNode *root,int &total)
{
if(root==NULL)
return 0;
int left=maxSum(root->left,total);
int right=maxSum(root->right,total);
int sum=root->val;
if(left>0)
sum+=left;
if(right>0)
sum+=right;
total=max(sum,total);
if(max(left,right)>0)
return max(left,right)+root->val;
else
return root->val;
}
int maxPathSum(TreeNode *root) {
int total=INT_MIN;
maxSum(root,total);
return total;
}
};
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int maxSum(TreeNode *root,int &total)
{
if(root==NULL)
return 0;
int left=maxSum(root->left,total);
int right=maxSum(root->right,total);
int sum=root->val;
if(left>0)
sum+=left;
if(right>0)
sum+=right;
total=max(sum,total);
if(max(left,right)>0)
return max(left,right)+root->val;
else
return root->val;
}
int maxPathSum(TreeNode *root) {
int total=INT_MIN;
maxSum(root,total);
return total;
}
};