# 404.Sum of Left Leaves

**404.Sum of Left Leaves**

难度:Easy

> 计算给定二叉树的所有左叶子之和。

示例：

```
    3
   / \
  9  20
    /  \
   15   7
```

在这个二叉树中，有两个左叶子，分别是 9 和 15，所以返回 24

按题意，递归求和。

```
/**
 * 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) {
        int res=0;
        if(!root) return res;
        if(!root->left && !root->right) return res;
        if(root->left && !root->left->left && !root->left->right  ) 
            res+=root->left->val;
        else if(root->left)
            res+=sumOfLeftLeaves(root->left);
        if(root->right)
            res+=sumOfLeftLeaves(root->right);
        return res;
    }
};
```

> 执行用时 : 8 ms, 在Sum of Left Leaves的C++提交中击败了93.86% 的用户\
> 内存消耗 : 13.6 MB, 在Sum of Left Leaves的C++提交中击败了78.97% 的用户


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://dfine.gitbook.io/leetcode/404.sum_of_left_leaves.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.