@@ -0,0 +1,752 @@
+# -*- coding:utf-8 -*-%0A# Definition for a  binary tree node%0A# class TreeNode:%0A#     def __init__(self, x):%0A#         self.val = x%0A#         self.left = None%0A#         self.right = None%0A%0Aclass Solution:%0A    # @param root, a tree node%0A    # @return an integer%0A    def sumNumbers(self, root):%0A        if not root:%0A            return 0%0A        sum_list = %5B%5D%0A        self._sumNumbers(root, 0, sum_list)%0A        return sum(sum_list)%0A%0A    def _sumNumbers(self, root, s, sum_list):%0A        if root is None:%0A            return%0A%0A        s = s * 10 + root.val%0A        if root.left is None and root.right is None:%0A            sum_list.append(s)%0A            return%0A%0A        self._sumNumbers(root.left, s, sum_list)%0A        self._sumNumbers(root.right, s, sum_list)%0A

add leetcode Sum Root to Leaf Numbers