Download Convert BST to Greater Tree.py
class Solution(object): # https://leetcode.com/problems/convert-bst-to-greater-tree/solution/ # def __init__(self): # self.total = 0 # def convertBST(self, root): # if root is not None: # self.convertBST(root.right) # self.total += root.val # root.val = self.total # self.convertBST(root.left) # return root def convertBST(self, root): total = 0 node = root stack =  while stack or node is not None: # push all nodes up to (and including) this subtree's maximum on # the stack. while node is not None: stack.append(node) node = node.right node = stack.pop() total += node.val node.val = total # all nodes with values between the current and its parent lie in # the left subtree. node = node.left return root
Leetcode 538 Convert BST to Greater Tree problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.