题目描述
给你一棵二叉树的根节点 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
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/deepest-leaves-sum
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
DFS
遍历整个树,维护树的最大深度。
- 当当前节点的深度==最大深度时,sum+=当前的value;
- 当当前节点深度>最大深度时,更新最大深度,sum归零,并加上当前value。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int depth = -1 , sum = 0;
void dfs(TreeNode* t, int d) {
if (!t) return;
if(d == depth) sum += t->val;
if (d > depth) sum = t->val, depth = d;
dfs(t->left, d + 1);
dfs(t->right, d + 1);
}
int deepestLeavesSum(TreeNode* root) {
dfs(root, 0);
return sum;
}
};
BFS
每次出队一层,最后出队的那一层就是想要的层最深的节点
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int deepestLeavesSum(TreeNode* root) {
queue<TreeNode*> q;
q.push(root);
int sum;
while (q.size()) {
sum = 0;
int n = q.size();
for (int i = 0; i < n; i ++ ) {
TreeNode* t = q.front();
q.pop();
sum += t->val;
if (t->left) {
q.push(t->left);
}
if (t->right) {
q.push(t->right);
}
}
}
return sum;
}
};