leetcode404. 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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/sum-of-left-leaves
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

代码

递归
递归终止条件为左叶子结点。

/**
 * 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==NULL || root->left==NULL && root->right==NULL)
           return 0;
        
        if(root->left!=NULL && root->left->left==NULL && root->left->right==NULL)
           return root->left->val +sumOfLeftLeaves(root->right);

        return sumOfLeftLeaves(root->left) + sumOfLeftLeaves(root->right);
    }
};

更完整写法

#include <iostream>

using namespace std;


/// Recursion
/// Time Complexity: O(n)
/// Space Complexity: O(h)

/// 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 {

private:
    int res = 0;

public:
    int sumOfLeftLeaves(TreeNode* root) {

        if(!root) return 0;

        dfs(root, false);
        return res;
    }

private:
    void dfs(TreeNode* node, bool isLeft){

        if(!node->left && !node->right){
            if(isLeft) res += node->val;
            return;
        }

        if(node->left) dfs(node->left, true);
        if(node->right) dfs(node->right, false);
    }
};


int main() {

    return 0;
}