1
# Definition for a binary tree node.
2
# class TreeNode:
3
#     def __init__(self, val=0, left=None, right=None):
4
#         self.val = val
5
#         self.left = left
6
#         self.right = right
7
class Solution:
8
    def sumRootToLeaf(self, root: Optional[TreeNode]) -> int:
9
        def path(root, p, ans):
10
            p.append(str(root.val))
11
            if root.left == None and root.right == None:
12
                t = int("".join(p), 2)
13
                p.pop()
14
                return t + ans
15
            if root.left == None:
16
                t = path(root.right, p, ans)
17
                p.pop()
18
                return t
19
            if root.right == None:
20
                t = path(root.left, p, ans)
21
                p.pop()
22
                return t
23
            t = path(root.left, p, ans) + path(root.right, p, ans)
24
            p.pop()
25
            return t
26

27
        return path(root, [], 0)