Find the sum of all left leaves in a given binary tree.
Example:
3
/ \
9 20
/ \
15 7
There are one left leaves in the binary tree, with values 15 respectively. Return 15.
题意:
求出二叉树中所有左叶子节点的val之和。
分析:
- 左叶子结点强调首先是叶子节点,同时又要是左节点,才加入运算
- 采用递归的方法
- 如果二叉树为空,直接返回0
- 如果二叉树的左子树即为左叶子结点(左子树没有左右孩子结点),返回左叶子节点的val值+sumOfLeftLeaves(右子树)的值
- 如果二叉树的左、右子树都存在孩子结点,则返回sumOfLeftLeaves(左子树)+sumOfLeftLeaves(右子树)的值
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int sumOfLeftLeaves(TreeNode root) {
int sum=0;
//如果root为空,返回0
if(root==null)
return 0;
//如果左子树即为左叶子节点,则返回左叶子节点的val值+sumOfLeftLeaves(右子树)的值
if(root.left!=null && root.left.left==null && root.left.right==null)
return root.left.val+sumOfLeftLeaves(root.right);
else
//否则返回递归调用sumOfLeftLeaves(左子树)+sumOfLeftLeaves(右子树)的值
return sumOfLeftLeaves(root.left)+sumOfLeftLeaves(root.right);
}
}