.
题目
Given the root of a binary tree, return the sum of all left leaves.
Example 1:
Input: root = [3,9,20,null,null,15,7]
Output: 24
Explanation: There are two left leaves in the binary tree, with values 9 and 15 respectively.
Example 2:
Input: root = [1]
Output: 0
Constraints:
The number of nodes in the tree is in the range [1, 1000].
-1000 <= Node.val <= 1000
.
代码
/**
* 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:
void backtrack(TreeNode* root, bool isRight, int& sum) {
if(root->left == NULL && root->right == NULL)
{
if(!isRight)
sum += root->val;
return;
}
if(root->left != NULL)
{
backtrack(root->left, false, sum);
}
if(root->right != NULL)
{
backtrack(root->right, true, sum);
}
return;
}
int sumOfLeftLeaves(TreeNode* root) {
if(root == NULL)
return 0;
int sum = 0;
backtrack(root, true, sum);
return sum;
}
};