LeetCode 404. Sum of Left Leaves

最新推荐文章于 2023-11-13 10:10:39 发布

sqyx008

最新推荐文章于 2023-11-13 10:10:39 发布

阅读量276

点赞数

分类专栏： LeetCode 文章标签： leetcode tree cpp leave bool

本文链接：https://blog.csdn.net/sqyx008/article/details/66713620

版权

LeetCode 专栏收录该内容

66 篇文章 0 订阅

订阅专栏

Description

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.

Analysis

Simply use a bool variable to mark whether the node is a left or right child of its father node. In my code, true represents left, while false represents right.

Code

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int sumOfLeftLeaves(TreeNode* root) {
        if (!root) return 0;
        sum = 0;
        find(root,false);
        return sum;
    }
private:
    int sum;
    void find(TreeNode* t, bool flag){
        if (t->left) find(t->left,true);
        if (t->right) find(t->right,false);
        if (!t->left && !t->right && flag) sum += t->val;
    }
};