How can I implement balanced trees in Python?

How can I implement balanced trees in Python?

You can implement balanced trees like AVL trees or Red-Black trees. Which one are you interested in?

I want to start with AVL trees. What are the basic operations I need to implement?

For AVL trees, you'll need to implement insertion, deletion, and rotation operations to maintain balance.

Can you provide a sample code for inserting a node in an AVL tree?

Sure! Here's a basic implementation of the insert operation in an AVL tree:

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

class AVLTree:
    def insert(self, root, key):
        # Normal BST insert
        if not root:
            return Node(key)
        elif key < root.val:
            root.left = self.insert(root.left, key)
        else:
            root.right = self.insert(root.right, key)

        # Update height and balance the tree
        root.height = 1 + max(self.getHeight(root.left), self.getHeight(root.right))
        balance = self.getBalance(root)

        # Perform rotations if unbalanced
        if balance > 1 and key < root.left.val:
            return self.rightRotate(root)
        if balance < -1 and key > root.right.val:
            return self.leftRotate(root)
        if balance > 1 and key > root.left.val:
            root.left = self.leftRotate(root.left)
            return self.rightRotate(root)
        if balance < -1 and key < root.right.val:
            root.right = self.rightRotate(root.right)
            return self.leftRotate(root)

        return root