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


class BST:
    def __init__(self):
        self.root = None

    def create_newnode(self, value):
        node = Node(value)
        return node

    def insert(self, value):
        if self.root is None:
            
            pass

    def search(self):
        pass

    def delete(self):
        pass

    def traverse_postorder(self):
        pass

    def traverse_inorder(self):
        pass

    def traverse_preorder(self):
        pass

    def search_by_value(self, value):
        pass


if __name__ == '__main__':
    pass
