给你一棵二叉树的根节点 root ,请你返回 层数最深的叶子节点的和 。
输入:root = [1,2,3,4,5,null,6,7,null,null,null,null,8]
输出:15
两种解法
①深度优先遍历
class Solution {
Map<Integer, Integer> map = new HashMap<>();
int max;
public int deepestLeavesSum(TreeNode root) {
dfs(root, 0);
return map.get(max);
}
void dfs(TreeNode root, int depth) {
if (root == null) return ;
max = Math.max(max, depth);
map.put(depth, map.getOrDefault(depth, 0) + root.val);
dfs(root.left, depth + 1);
dfs(root.right, depth + 1);
}
}
②广度优先遍历
class Solution {
public int deepestLeavesSum(TreeNode root) {
Map<Integer, Integer> map = new HashMap<>();
Deque<TreeNode> d = new ArrayDeque<>();
d.addLast(root);
int depth = 0;
while (!d.isEmpty()) {
int sz = d.size();
while (sz-- > 0) {
TreeNode node = d.pollFirst();
map.put(depth, map.getOrDefault(depth, 0) + node.val);
if (node.left != null) d.addLast(node.left);
if (node.right != null) d.addLast(node.right);
}
depth++;
}
return map.get(depth - 1);
}
}