Easy-32

最新推荐文章于 2024-05-24 18:16:54 发布

Lancher_Mo

最新推荐文章于 2024-05-24 18:16:54 发布

阅读量222

点赞数

分类专栏： Lancher's re-code life 文章标签： leetcode

本文链接：https://blog.csdn.net/Lancher_Mo/article/details/71379689

版权

Lancher's re-code life 专栏收录该内容

49 篇文章 0 订阅

订阅专栏

leetcode 404. Sum of Left Leaves

Find the sum of all left leaves in a given binary tree.

Example:

    3
   / \
  9  20
    /  \
   15   7

There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.

AC:

/**
* Definition for a binary tree node.
* struct TreeNode {
*     int val;
*     struct TreeNode *left;
*     struct TreeNode *right;
* };
*/
int travel(struct TreeNode* root,int sign)
{
    if(root==NULL){
        return 0;
    }
    int leftSum=0;
    int rightSum=0;
    if(root->left!=NULL){
        leftSum=travel(root->left,1);
    }
    if(root->right!=NULL){
        rightSum=travel(root->right,2);
    }
    if(sign==1)
    {
        if(root->left!=NULL||root->right!=NULL){
            return leftSum+rightSum;
        }
        return leftSum+rightSum+root->val;
    }
    else
    {
        return leftSum+rightSum;
    }
}
int sumOfLeftLeaves(struct TreeNode* root) {
    int result=travel(root,0);
    return result;
}