129根节点到叶子节点数字之和

简单的递归可实现

class Solution {
    static int sum;    
    public int sumNumbers(TreeNode root) {    
        sum = 0;        
        childSum(0, root);        
        return sum;    
     }    
    public static void  childSum(int val, TreeNode root) {    
        if(root == null) return;        
        int k = (val * 10 + root.val) ;        
        if(root.left == null && root.right == null) {      
              sum += k;        
        }       
        childSum(k, root.left);        
        childSum(k, root.right);   
 }}