给你一棵二叉树的根节点 root
,请你返回 层数最深的叶子节点的和 。
通过层序遍历,找到最后一层,并计算节点数之和即可
代码如下
class Solution {
public int deepestLeavesSum(TreeNode root) {
LinkedList<TreeNode> queue = new LinkedList<>();
int res = 0;
if (root == null) return res;
queue.add(root);
while (!queue.isEmpty()) {
int size = queue.size();
int sum = 0;
for (int i = 0; i < size; i++) {
TreeNode node = queue.removeFirst();
sum = sum + node.val;
if (node.left != null) queue.add(node.left);
if (node.right != null) queue.add(node.right);
}
res = sum;
}
return res;
}
}