Visualize binary search trees and their self-balancing variants. Watch insertions, deletions, rotations, and recoloring unfold step by step. Compare how AVL and Red-Black trees maintain balance.
A basic BST with no balancing. Insertions follow the BST property but can lead to degenerate (linked-list) shapes.
A BST's performance depends entirely on its shape. Sorted input creates a degenerate tree with O(n) operations -- essentially a linked list.