LeetCode-Sum of Left Leaves

Description：
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.

题意：给定一颗二叉树，计算所有叶子节点中为其父节点的左孩子节点值得和；

解法：这一道题得关键是如何找到其叶子节点并且判断为左叶子节点；我们可以设置一个标志变量，每次遍历孩子节点得时候给左右孩子节点赋不一样的值来辨别左右孩子；

Java

/**
 * 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 leftChild) {
        if (root == null) return 0;
        if (root.left == null && root.right == null) {
            return leftChild ? root.val : 0;
        } 
        return sumOfLeft(root.left, true) + sumOfLeft(root.right, false);
    }
}