Maximum Sum along any path in java (#1817)

* Maximum Sum along any path in java

* Updated readme file

* update

Co-authored-by: Rudrakshi <[email protected]>

Author: shubhidua

Tree/readme.md

@@ -61,7 +61,7 @@ that, this property should be satisfied at every node in the tree.
 * Left View of  a Binary Tree----> [C++](/Code/C++/left-view.cpp)
 * Level Order Traversal in BST ----> [C++]() | [Java]() | [Python](/Code/Python/level_order_traversal_binary_tree.py)
 * Lowest common ancestor in a binary tree ----> [Python](/Code/Python/LCA_in_binary_tree.py)
-* Maiximum  sum path from any node to any node in Binary Tree  ----> [C++](/Code/C++/max_tree_path.cpp)
+* Maiximum  sum path from any node to any node in Binary Tree  ----> [C++](/Code/C++/max_tree_path.cpp) | [Java](/Code/Java/maximumSum.java)
 * Maximum Topology Short ----> [C++](/Code/C++/Max_Topology_Short.cpp)
 * Median of running streams of integers ----> [C++](/Code/C++/median_running_stream.cpp) 
 * N-ary Tree ----> [Python](/Code/Python/n_ary_tree.py)
@@ -76,3 +76,4 @@ that, this property should be satisfied at every node in the tree.
 * Searching in BST ----> [C++](/Code/C++/searching_in_bst.cpp) | [Java](Code\Java\Searching_in_BST.Java)
 * Threaded Tree ----> [C++](/Code/C++/threaded_binary_tree.cpp) 
 * Top-View of a Binary tree ----> [C++](/Code/C++/Top-View.cpp) 
+

maximumSum.java

@@ -0,0 +1,59 @@
+/*
+Problem Statement-
+We need to find maximum sum path from any node to any node in a binary tree.
+
+Algorithm-
+In order to check this we need to traverse through all the possible paths.
+We start traversing from the one node and we keep on storing the max result in a variable.
+
+*/
+
+import java.io.*;
+import java.util.*;
+
+//Creating basic tree data structure
+class Node {
+	int val;
+	Node left,right;
+	// constructor
+
+	Node(int data){
+		val=data;
+		left=null;
+		right=null;
+	}
+}
+
+public class maximumSum {
+    static int ans;
+    public static void main(String[] args) throws IOException {
+        Scanner sc=new Scanner(System.in);
+        Node root=new Node(-10);
+        root.left=new Node(9);
+        root.right=new Node(20);
+        root.right.left=new Node(15);
+        root.right.right=new Node(7);
+
+        ans=Integer.MIN_VALUE;
+        maxSum(root);
+        System.out.println(ans);
+
+		sc.close();
+		return;
+    }
+
+    // An recursive function to find the maximum sum along any path.
+    // Stores the result in a variable named as answer.
+    public static int maxSum(Node root){
+        if (root == null) return 0;
+        int left = Math.max(0, maxSum(root.left));
+        int right = Math.max(0, maxSum(root.right));
+        ans = Math.max(ans, left + right +root.val);
+        return Math.max(left, right) +root.val;
+    }
+}
+/*
+Time Complexity-O(n);
+Space Complexity-O(n);
+
+*/