How can I implement a binary search tree in Python?

How can I implement a binary search tree in Python?

To implement a binary search tree (BST) in Python, you can start by defining a Node class to represent each node in the tree.

What methods should I include in the BST class?

You should include methods like insert, delete, search, and traverse (in-order, pre-order, post-order) in your BST class.

Can you show me a simple implementation of the insert method?

Sure! Here's a basic implementation of the insert method:

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)

How do I traverse the tree in order?

You can implement in-order traversal like this:

    def in_order_traversal(self, node):
        if node:
            self.in_order_traversal(node.left)
            print(node.value, end=' ')
            self.in_order_traversal(node.right)