sum-root-to-leaf-numbers[根到叶节点路径之和]

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.
An example is the root-to-leaf path 1->2->3 which represents the number 123.
Find the total sum of all root-to-leaf numbers.
For example,

The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.
Return the sum = 12 + 13 =25.

• 思路
  求根节点到叶节点的路径组合数字之和，如上样例。
  前序遍历该树，定义一个方法，表示当前节点到所有叶节点的组合数字和，其中当前值为sum。当节点为空时返回0，否则计算到此节点的组合数字；当该节点为叶节点时返回sum值，否则返回其左右子树的结果之和。参考链接

/**
 * 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) {
        if(root == null)
            return 0;
        
        return preTraverseGetNum(root, 0);
    }
    
    public int preTraverseGetNum(TreeNode node, int sum){
        if(node == null)
            return 0;
        
        sum = sum * 10 + node.val;
        if(node.left == null && node.right == null)
            return sum;
        
        return preTraverseGetNum(node.left, sum) + preTraverseGetNum(node.right, sum);
    }
}