Binary Tree Maximum Path Sum

Given a binary tree, find the maximum path sum.

The path may start and end at any node in the tree.

For example:
Given the below binary tree,

       1
      / \
     2   3

Return 6.

/**
 * 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 findMaxSum(TreeNode* root,int& pathMax,int& maxNode){
        if(root==NULL){
            pathMax = 0;
            return 0;
        }
        if(root->val>maxNode) maxNode = root->val;
        int left,right,leftPath,rightPath;
        left = findMaxSum(root->left,leftPath,maxNode);
        right = findMaxSum(root->right,rightPath,maxNode);
        pathMax = max(max(leftPath,rightPath)+root->val,0);
        return max(max(left,right),leftPath+rightPath+root->val);
    }
    int maxPathSum(TreeNode *root) {
        if(root==NULL) return 0;
        int m,maxNode=root->val;
        int ans = findMaxSum(root,m,maxNode);
        if(ans==0) return maxNode;
        return ans;
    }
};