Insert, search, delete, and traverse — watch every step animate live
Insert, search, delete, and traverse a BST step-by-step
BST property: left child < parent < right child
Follow BST ordering down the tree until an empty spot is found
Halve the remaining nodes at each comparison — O(log n) average
3 cases: leaf, one child, two children (inorder successor replaces)