Bst.py

class Node:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None

class Tree:
    def __init__(self):
        self.root = None
    
    def insert(self, value):
        if self.root is None:
            self.root = Node(value)
            return
        
        # else
        t = root
        while True:
            if t.value > value:
                if t.right is None:
                    t.right = Node(value)
                    break
                # else
                t = t.right
            else:
                if t.left is None:
                    t.left = Node(value)
                    break
                t = t.left