404. 左叶子之和（树）

方法：
找到叶子结点的同时要知道该叶子使左叶子，所以要用一个参数标识叶子为左叶子；

/**
 * 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) {
        return calLeftLeaves(root,-1);
    }
    //LeftorRight用于标识遍历子节点的左子树还是右子树
    public int calLeftLeaves(TreeNode root,int LeftorRight){
        if(root == null) return 0;
        if((root.left==null) && (root.right == null)&&(LeftorRight == 0)) return root.val;
        if((root.left==null) && (root.right == null)&&(LeftorRight == 1)) return 0;
        
        int left = calLeftLeaves(root.left,0);

        int right = calLeftLeaves(root.right,1);

        return left+right;
    }
}