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.
注:根节点的右子树中可能有左子树,根节点的左子树的右子树中也有可能有左子树
叶子节点不是最外层传入的根节点
代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int sumOfLeftLeaves(TreeNode root) {
if(root==null)
return 0;
return sumOfLeft(root.left,true)+sumOfLeft(root.right,false);
}
private int sumOfLeft(TreeNode root,boolean isLeft){
if(root==null)
return 0;
if(isLeft&&root.left==null&&root.right==null)
return root.val;
return sumOfLeft(root.left,true)+sumOfLeft(root.right,false);
}
}