leetcode: 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

Solution

利用二叉排序树的性质，实际上只要反向遍历一遍树，并在遍历过程中做加操作就行

class Solution:

    def convertBST(self, root):
        """
        :type root: TreeNode
        :rtype: TreeNode
        """
        summ = [0]
        #self.summ = 0
        def summation(root):
            if not root:
                return 
            summation(root.right)
            root.val += summ[0]
            #root.val += self.summ
            summ[0] = root.val
            #self.summ = root.val
            summation(root.left)
        summation(root)
        return root

注意以上代码中，两种“使用”全局变量的方法。
使用global声明无法让python中int型变量在递归调用中正确传递