简单的DFS
/**
* 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 sumValue(TreeNode* root,int& sum)
{
if(root==NULL)
return;
if(root->left!=NULL)
{
if(root->left->left==NULL&&root->left->right==NULL)
sum+=root->left->val;
sumValue(root->left,sum);
}
if(root->right!=NULL)
sumValue(root->right,sum);
}
int sumOfLeftLeaves(TreeNode* root) {
int sum=0;
sumValue(root,sum);
return sum;
}
};