LeetCode 129 Sum Root to Leaf Numbers

/** 
 * Definition for binary tree 
 * public class TreeNode { 
 *     int val; 
 *     TreeNode left; 
 *     TreeNode right; 
 *     TreeNode(int x) { val = x; } 
 * } 
 */  
public class Solution {  
    public int sumNumbers(TreeNode root) {  
        return sumSubTree(0, root);  
    }  
      
    private int sumSubTree(int decade, TreeNode subTreeRoot) {  
        int sum = 0;  
        if (subTreeRoot == null) {  
            return 0;  
        } else {  
            if (subTreeRoot.left == null && subTreeRoot.right == null) {  
                // leaf node  
                sum = decade * 10 + subTreeRoot.val;  
            } else {  
                // has child node  
                if (subTreeRoot.left != null) {  
                    sum += sumSubTree(decade*10+subTreeRoot.val, subTreeRoot.left);  
                }  
                if (subTreeRoot.right != null) {  
                    sum += sumSubTree(decade*10+subTreeRoot.val, subTreeRoot.right);  
                }  
            }  
        }  
        return sum;  
    }  
}  

作者:ywheel
本文出处:http://blog.ywheel.cn/post/2015/03/07/leetcode_129/
文章版权归本人所有,欢迎转载,但必须保留此段声明,且在文章页面明显位置给出原文连接,否则保留追究法律责任的权利。