LeetCode 404 Sum of Left Leaves

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.

求二叉树的所有左边叶子的和。

	public int sumOfLeftLeaves(TreeNode root) {
		if (root == null) return 0;
		int leaf = 0;
		if (root.left != null && root.left.right == null && root.left.left == null)
			leaf = root.left.val;
		return leaf + sumOfLeftLeaves(root.left) + sumOfLeftLeaves(root.right);
	}