g1301_1400.s1302_deepest_leaves_sum.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g1301_1400.s1302_deepest_leaves_sum;
// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
// #2022_03_14_Time_5_ms_(59.50%)_Space_44.1_MB_(92.78%)
import com_github_leetcode.TreeNode;
import java.util.LinkedList;
import java.util.Objects;
import java.util.Queue;
/*
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
public class Solution {
public int deepestLeavesSum(TreeNode root) {
Queue queue = new LinkedList<>();
queue.offer(root);
int sum = 0;
while (!queue.isEmpty()) {
int size = queue.size();
sum = 0;
for (int i = 0; i < size; i++) {
TreeNode curr = queue.poll();
sum += Objects.requireNonNull(curr).val;
if (curr.left != null) {
queue.offer(curr.left);
}
if (curr.right != null) {
queue.offer(curr.right);
}
}
}
return sum;
}
}