How do I implement a balanced binary tree?

How do I implement a balanced binary tree?

To implement a balanced binary tree, you can use data structures like AVL trees or Red-Black trees. Which one would you prefer?

What's the difference between AVL trees and Red-Black trees?

AVL trees maintain a stricter balance than Red-Black trees, which can lead to faster lookups but slower insertions and deletions. Red-Black trees are more flexible with balancing.

Can you show me a simple code example for an AVL tree?

Sure! Here's a basic implementation of an AVL tree in Python:

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

    # Additional methods for rotations, height, and balance would go here.

This is a starting point!

Thanks! How do I perform deletions in an AVL tree?

To delete a node in an AVL tree, you first perform a standard BST deletion, then update the height and balance the tree. Would you like a code example for that?