Madeinmato

[madeinmato]

class Node:
def init(self, key):
self.key = key
self.left = None
self.right = None

class BinarySearchTree:
def init(self):
self.root = None

def insert(self, key):
    if self.root is None:
        self.root = Node(key)
    else:
        self._insert(self.root, key)

def _insert(self, node, key):
    if key < node.key:
        if node.left is None:
            node.left = Node(key)
        else:
            self._insert(node.left, key)
    else:
        if node.right is None:
            node.right = Node(key)
        else:
            self._insert(node.right, key)

def search(self, key):
    return self._search(self.root, key)

def _search(self, node, key):
    if node is None or node.key == key:
        return node
    if key < node.key:
        return self._search(node.left, key)
    return self._search(node.right, key)