Leetcode 538. 把二叉搜索树转换为累加树

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

class Solution:
    def convertBST(self, root: TreeNode) -> TreeNode:
        self.num = 0
        def depthfirstsearch(root):
            if root is None:
                return 
            else:
                depthfirstsearch(root.right)
                self.num = self.num + root.val
                root.val = self.num
                depthfirstsearch(root.left)
                return root
        return depthfirstsearch(root)