leetcode/solution/897_Increasing_Order_Search_Tree.py at master · CodexploreRepo/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
# 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 increasingBST(self, root: TreeNode) -> TreeNode:
        val_list = []

        def inorder_traversal(root):
            if root:
                inorder_traversal(root.left)
                val_list.append(root.val)
                inorder_traversal(root.right)

        inorder_traversal(root)

        new_root = TreeNode(val = val_list.pop(0))
        curr = new_root

        for i in range(0, len(val_list)):
            val = val_list[i]
            curr.right = TreeNode(val=val)
            curr = curr.right

        return new_root