【Leetcode 每日一题】129. 求根到叶子节点数字之和 （先序遍历，记录根到叶子节点的值）

Leetcode每日一题
题目链接： 129. 求根到叶子节点数字之和
解题思路： 先序遍历，记录根到叶子节点的值，每次遍历到叶子节点进行加和。
题解：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def traver(self, root: TreeNode, value: int) -> int:
        if root == None:
            return
        if root.left == None and root.right == None:
            value = value * 10 + root.val
            self.count += value
            # print(value)
            return
        value = value * 10 + root.val
        # self.list_root.append(root.val)
        self.traver(root.left, value)
        self.traver(root.right, value)

    def sumNumbers(self, root: TreeNode) -> int:
        if root == None:
            return 0
        self.count = 0
        self.traver(root, 0)
        return self.count