二叉树根节点到叶子节点的所有路径和

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

# @param root TreeNode类 
# @return int整型
#
class Solution:
    def sumNumbers(self , root ):
        # write code here
        # 先序遍历
        def dfs(root, sums):
            if not root: return 0
            
            sums = 10 * sums  + root.val # 计算路径的值
            if not root.left and not root.right: return sums  # 到达叶节点则返回
            
            return dfs(root.left, sums) + dfs(root.right, sums)
        
        if not root: return 0
        
        return dfs(root, 0)