leetcode404. 左叶子之和

1.题目描述：

计算给定二叉树的所有左叶子之和。

 2.深搜递归：

首先是计算所有叶子结点的和，这个较容易：

/**
 * 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 root.val;
        return sumOfLeftLeaves(root.left) + sumOfLeftLeaves(root.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) return root.left.val + sumOfLeftLeaves(root.right);
    return sumOfLeftLeaves(root.left) + sumOfLeftLeaves(root.right);
    }
}

3.广搜迭代：

较简单见代码：

class Solution {
    public int sumOfLeftLeaves(TreeNode root) {
        if(root == null) return 0;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        int count = 0;
        while(!queue.isEmpty()){
            TreeNode node = queue.poll();
            if(node.left != null && node.left.left == null && node.left.right == null) count += node.left.val;
            if(node.left != null) queue.offer(node.left);
            if(node.right != null) queue.offer(node.right);
        }
        return count;
    }
}