LeetCode-1302-层数最深叶子节点的和
给你一棵二叉树的根节点 root
,请你返回 层数最深的叶子节点的和 。
示例 1:
输入:root = [1,2,3,4,5,null,6,7,null,null,null,null,8]
输出:15
示例 2:
输入:root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5]
输出:19
提示:
- 树中节点数目在范围
[1, 104]
之间。 1 <= Node.val <= 100
class Solution {
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 int deepestLeavesSum(TreeNode root) {
Queue<TreeNode> queue = new ArrayDeque<>();
int res = 0;
queue.add(root);
while (!queue.isEmpty()) {
int size = queue.size();
res = 0;
for (int i = 0; i < size; i++) {
TreeNode node = queue.poll();
res += node.val;
if (node.left != null) {
queue.offer(node.left);
}
if (node.right != null) {
queue.offer(node.right);
}
}
}
return res;
}
}