leetcode404左叶子求和

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

示例：

    3
   / \
  9  20
    /  \
   15   7

在这个二叉树中，有两个左叶子，分别是 9 和 15，所以返回 241.

1 使用递归

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

2.循环 非递归

/**
 * 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) {
        int sum=0;
        if(root==null)
            return sum;
        Stack<TreeNode> stack=new Stack<TreeNode>();
        stack.push(root);
        while(!stack.isEmpty()){
            TreeNode cur=stack.pop();
            if(cur.left!=null){
                 if(cur.left.left==null&&cur.left.right==null){
                       sum=sum+cur.left.val;
                 }                  
                else{
                    stack.push(cur.left);
                }
            }
            if(cur.right!=null){
                if(cur.right.left!=null||cur.right.right!=null)
                    stack.push(cur.right);
            }               
    }        
        return sum;        
    }
}