Find the sum of all left leaves in a given binary tree.
Example:
3
/ \
9 20
/ \
15 7
There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.
//使用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:
int sumOfLeftLeaves(TreeNode* root){
return dfs(root,false);
}
int dfs(TreeNode* toot,bool isLeft){
if(root==NULL) return 0;
if(root->left==NULL&&root->right==NULL&&isleft) return root->val;
return dfs(root->left,true)+dfs(root->right,false);
}
};
- *