题解 | 二叉排序树

class btree:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right

class bTtreesearch:
    def __init__(self):
        self.root = None
    def insert(self, val):
        if self.root == None:
            self.root = btree(val)
            return -1
        
        parent = None
        current = self.root
        while current:
            parent = current
            if val < current.val:
                current = current.left
            else:
                current = current.right
        if val < parent.val:
            parent.left = btree(val)
        else:
            parent.right = btree(val)
        return parent.val

n = int(input())
s = list(map(int, input().split()))
Bt = bTtreesearch()

for i in s:
    p = Bt.insert(i)
    print(p)