[LeetCode]404. 左叶子之和

原题链接：https://leetcode-cn.com/problems/sum-of-left-leaves/

思路：
递归，dfs
左叶子节点：是父亲节点的左孩子，左节点和右节点都是null

代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int sumOfLeftLeaves(TreeNode root) {
        if(root == null) {
            return 0;
        }
        if (root.left != null && root.left.left == null && root.left.right == null) {
        	// 左叶子节点 + root的右孩子对应的sumOfLeftLeaves
            return root.left.val + sumOfLeftLeaves(root.right);
        }
        return sumOfLeftLeaves(root.left) + sumOfLeftLeaves(root.right);
    }
}