[LeetCode] Sum of Left Leaves

Posted immjc

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] 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.

 题目要求树的所有左叶节点的和,根据题意判断出所有左叶节点,使用递归即可。

class Solution {
public:
    int sumOfLeftLeaves(TreeNode* root) {
        if (root == nullptr)
            return 0;
        if (root->left != nullptr && root->left->left == nullptr && root->left->right == nullptr)
            return root->left->val + sumOfLeftLeaves(root->right);
        return sumOfLeftLeaves(root->left) + sumOfLeftLeaves(root->right);
    }
};
// 6 ms

 

以上是关于[LeetCode] Sum of Left Leaves的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode 404. Sum of Left Leaves

leetcode?python Sum of Left Leaves

Leetcode: Sum of Left Leaves

[leetcode-404-Sum of Left Leaves]

LeetCode: Sum of Left Leaves

LeetCode 404. Sum of Left Leaves