How can I implement a binary search tree in Python?

How can I implement a binary search tree in Python?

You can start by defining a class for the tree nodes. Each node should have a value, a left child, and a right child.

Can you show me a simple implementation?

Sure! Here's a basic implementation:

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

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

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

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

What about searching for a value in the tree?

You can add a search method to your BST class. Here's an example:

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

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