-
Notifications
You must be signed in to change notification settings - Fork 11
Expand file tree
/
Copy pathSumOfNodes.java
More file actions
51 lines (45 loc) · 1.75 KB
/
SumOfNodes.java
File metadata and controls
51 lines (45 loc) · 1.75 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
package binaryTrees1;
import static binaryTrees1.BinaryTreeInput.printBinaryTree;
import static binaryTrees1.BinaryTreeInput.takeTreeInputDetailed;
/*For a given Binary Tree of integers, find and return the sum of all the nodes data.
Example:
10
/ \
20 30
/ \
40 50
When we sum up all the nodes data together, [10, 20, 30, 40 50] we get 150. Hence, the output will be 150.
Input Format:
The first and the only line of input will contain the nodes data, all separated by a single space. Since -1 is used as an indication whether the left or right node data exist for root, it will not be a part of the node data.
Output Format:
The first and the only line of output prints the sum of all the nodes data present in the binary tree.
Note:
You are not required to print anything explicitly. It has already been taken care of.
Constraints:
1 <= N <= 10^6
Where N is the total number of nodes in the binary tree.
Time Limit: 1 sec
Sample Input 1:
2 3 4 6 -1 -1 -1 -1 -1
Sample Output 1:
15
Sample Input 2:
1 2 3 4 5 6 7 -1 -1 -1 -1 -1 -1 -1 -1
Sample Output 2:
28
*/
public class SumOfNodes {
public static int sumOfNodes(BinaryTreeNode<Integer> root) {
if (root == null) return 0;
int leftSum = sumOfNodes(root.left);
int rightSum = sumOfNodes(root.right);
return root.data + leftSum + rightSum;
}
public static void main(String[] args) {
var root = takeTreeInputDetailed(true, 0, true);
System.out.println("----------The Tree is----------");
printBinaryTree(root);
System.out.println("--------------------------------");
System.out.println("Sum of All Nodes = " + sumOfNodes(root));
}
}