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 example of how to create a node?

Sure! Here's a basic implementation:

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

How do I insert a new value into the binary search tree?

You can create an insert method that compares the new value with the current node's value and decides whether to go left or right.

Could you provide an example of the insert method?

Absolutely! Here's a simple insert method:

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

    def insert(self, value):
        if not self.root:
            self.root = TreeNode(value)
        else:
            self._insert_recursively(self.root, value)

    def _insert_recursively(self, node, value):
        if value < node.value:
            if node.left:
                self._insert_recursively(node.left, value)
            else:
                node.left = TreeNode(value)
        else:
            if node.right:
                self._insert_recursively(node.right, value)
            else:
                node.right = TreeNode(value)