解题思路:
(1)判断该节点为左孩子
(2)判断该节点为叶子节点
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
void preorder(TreeNode *root,int &sum) {
if(root) {
if(root->left) {
if(root->left->left==NULL && root->left->right==NULL)
sum+=root->left->val;
}
preorder(root->left,sum);
preorder(root->right,sum);
}
}
int sumOfLeftLeaves(TreeNode* root) {
int sum = 0;
preorder(root,sum);
return sum;
}
};