Skip to content

Commit 11aafb2

Browse files
authored
Create Maximum Level Sum of a Binary Tree
1 parent e38efec commit 11aafb2

File tree

1 file changed

+40
-0
lines changed

1 file changed

+40
-0
lines changed

Maximum Level Sum of a Binary Tree

Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
/**
2+
* Definition for a binary tree node.
3+
* public class TreeNode {
4+
* int val;
5+
* TreeNode left;
6+
* TreeNode right;
7+
* TreeNode() {}
8+
* TreeNode(int val) { this.val = val; }
9+
* TreeNode(int val, TreeNode left, TreeNode right) {
10+
* this.val = val;
11+
* this.left = left;
12+
* this.right = right;
13+
* }
14+
* }
15+
*/
16+
class Solution {
17+
Map<Integer, Integer> sums = new HashMap<>();
18+
public int maxLevelSum(TreeNode root) {
19+
helper(root, 1);
20+
int max = Integer.MIN_VALUE;
21+
int level = 0;
22+
Iterator hmIterator = sums.entrySet().iterator();
23+
while (hmIterator.hasNext()) {
24+
Map.Entry mapElement = (Map.Entry)hmIterator.next();
25+
if((int)mapElement.getValue() > max){
26+
max = (int)mapElement.getValue();
27+
level = (int)mapElement.getKey();
28+
}
29+
}
30+
return level;
31+
}
32+
public void helper(TreeNode root, int depth){
33+
if(root == null){
34+
return ;
35+
}
36+
sums.put(depth, sums.getOrDefault(depth, 0)+root.val);
37+
helper(root.left, depth+1);
38+
helper(root.right, depth+1);
39+
}
40+
}

0 commit comments

Comments
 (0)