给你一棵二叉树的根节点 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
链接:https://leetcode.cn/problems/deepest-leaves-sum
使用递归方法(深度优先): 先遍历左子树到最深处,用max标记最大的层数,再遍历右子树直到到达最深处,再和左子树最深的节点相加。
/**
* 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 {
int sum=0;
int max=0;
public:
int deepestLeavesSum(TreeNode* root) {
help(root,0);
return sum;
}
void help(TreeNode* root,int leve)
{
if(root==NULL)
return;
if(leve>max)
{
max=leve;
sum=root->val;
}
else if(leve==max)
sum+=root->val;
help(root->left,leve+1);
help(root->right,leve+1);
}
};
使用队列层序遍历(广度优先):
class Solution {
public:
int deepestLeavesSum(TreeNode* root) {
queue<TreeNode *>q;
q.push(root);
int ans=0,len;
while(!q.empty())
{
ans=0;
len=q.size();
while(len--)
{
TreeNode *t=q.front();
q.pop();
ans+=t->val;
if(t->left)
q.push(t->left);
if(t->right)
q.push(t->right);
}
}
return ans;
}
};