We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 25ba7da commit dc29c0fCopy full SHA for dc29c0f
src/main/java/com/fishercoder/solutions/_1302.java
@@ -43,4 +43,27 @@ private int maxDepth(TreeNode root) {
43
return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
44
}
45
46
+
47
+ public static class Solution2 {
48
+ public int deepestLeavesSum(TreeNode root) {
49
+ Queue<TreeNode> queue = new LinkedList<>();
50
+ queue.offer(root);
51
+ int sum = 0;
52
+ while (!queue.isEmpty()) {
53
+ int size = queue.size();
54
+ sum = 0;
55
+ for (int i = 0; i < size; i++) {
56
+ TreeNode curr = queue.poll();
57
+ sum += curr.val;
58
+ if (curr.left != null) {
59
+ queue.offer(curr.left);
60
+ }
61
+ if (curr.right != null) {
62
+ queue.offer(curr.right);
63
64
65
66
+ return sum;
67
68
69
0 commit comments