来自LeetCode----->404
解决的方法如下:
核心思路--------父亲的右孩子不为当前叶子本身,即为我们需要的叶子(首先筛选出叶子结点)
叶子----->Node.left == null && Node.right == null
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
int all_leftY;
public int sumOfLeftLeaves