Create BinaryTree MaximumPathSum

Author: AnuragGupta2022

BinaryTree MaximumPathSum

@@ -0,0 +1,15 @@
+ int solve(TreeNode* root,int& mx){
+        if(!root) return 0;
+        
+        int left=max(0,solve(root->left,mx));
+        int right=max(0,solve(root->right,mx));
+        int currVal=root->val;
+        
+        mx=max(mx,left+right+currVal);
+        return max(left,right)+currVal;
+    }
+    int maxPathSum(TreeNode* root) {
+        int mx=INT_MIN;
+        solve(root,mx);
+        return mx;
+    }