递归再递归
/**
* 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 ans = 0;
if(!root) return 0;
sum(root,root->right,ans);
sum(root,root->left,ans);
return ans;
}
void sum(TreeNode* q,TreeNode* p,int& ans)
{
if(!p) return;
else if(!p->left && !p->right)
{
if(q->left == p)
{
ans+= p->val;
return;
}
else return;
}
sum(p,p->left,ans);
sum(p,p->right,ans);
}
};