class Solution {
int ans = 0;
public int sumOfLeftLeaves(TreeNode root) {
if(root==null)return 0;
dfs(root);
return ans;
}
public void dfs(TreeNode root){
if(root.left!=null&&root.left.left==null&&root.left.right==null){
ans+=root.left.val;
}
if(root.left!=null){
dfs(root.left);
}
if(root.right!=null){
dfs(root.right);
}
}
}
递归一定要弄清楚结果的条件!!!!!