leetcode-algorithms/python/convert_bst_to_greater_tree.py at master · anishLearnsToCode/leetcode-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
# Definition for a binary tree node.
class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right


class Solution:
    def __init__(self):
        self.value = 0

    def computeGreaterTree(self, root: TreeNode):
        if root is None: return
        self.computeGreaterTree(root.right)
        root.val += self.value
        self.value = root.val
        self.computeGreaterTree(root.left)

    def convertBST(self, root: TreeNode) -> TreeNode:
        self.computeGreaterTree(root)
        return root