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 example of the insert method?

Sure! Here's a simple insert method:

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

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

    def insert(self, root, key):
        if root is None:
            return self.Node(key)
        else:
            if root.val < key:
                root.right = self.insert(root.right, key)
            else:
                root.left = self.insert(root.left, key)
        return root

What about the search method?

The search method can be implemented like this:

def search(self, root, key):
    if root is None or root.val == key:
        return root
    if root.val < key:
        return self.search(root.right, key)
    return self.search(root.left, key)