AVL Tree (Self-Balancing BST)

A height-balanced binary search tree that rotates after inserts to keep every balance factor in {−1, 0, +1}.