LeetCode：404、左叶子之和

/**
 * 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.right==null)return 0;
        int leftval=0;
        if(root.left!=null&&root.left.left==null&&root.left.right==null){//找到左叶子
            leftval=root.left.val;
        }
        return leftval+sumOfLeftLeaves(root.left)+sumOfLeftLeaves(root.right);
    }
}

404. 左叶子之和 - 力扣（LeetCode）