Convert BST to Greater Tree【将二叉树转换】

PROBLEM:

Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.

Example:

Input: The root of a Binary Search Tree like this:
              5
            /   \
           2     13

Output: The root of a Greater Tree like this:
             18
            /   \
          20     13

SOLVE:

# 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):
        """
        :type root: TreeNode
        :rtype: TreeNode
        """
        vals=[]
        self.sumv=0
        def finding(root):
            if not root: return
            finding(root.left)
            vals.append(root.val)
            finding(root.right)
        finding(root)
        def convert(root):
            if not root: return
            convert(root.right)
            self.sumv+=vals.pop()
            root.val=self.sumv
            convert(root.left)
        convert(root)
        return root

此解中：类方法中还可以定义普通函数及调用，其中普通变量需要创建为 self.xxx（类属性）才能在普通函数中调用，而list不需要（长知识了）