1302. Deepest Leaves Sum 求一个树的最深叶子节点的值的和（C语言）

1302. Deepest Leaves Sum（C语言）

求一个树的最深叶子节点的值的和

题目

Given the root of a binary tree, return the sum of values of its deepest leaves.

Example 1:

Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8]
Output: 15

Example 2:
Input: root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5]
Output: 19

Constraints:
The number of nodes in the tree is in the range [1, 104].
1 <= Node.val <= 100

解答

递归

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int max_deep;
int sum;
void Tra(struct TreeNode* root, int deep)
{
    if(root == NULL)
    {
        return ;
    }
    if(root->left == NULL && root->right == NULL)
    {
        if(deep > max_deep)
        {
            max_deep = deep;
            sum = root->val;
        }
        else if(deep == max_deep)
        {
            sum += root->val;
        }
    }
    Tra(root->left, deep + 1);
    Tra(root->right, deep + 1);
}
int deepestLeavesSum(struct TreeNode* root){
    int deep = 0;
    sum = 0;
    max_deep = 0;
    Tra(root, deep);
    return sum;
}

总结

用递归的方式从左到右遍历整个树，用了两个全局变量记录。