AVL Trees Explained: Rotations, Balance Factors, and Self-Balancing BSTs
You insert [1, 2, 3, 4, 5] into an empty binary search tree and watch every value land to the right of the previous one. The tree is a straight line. Five nodes deep. Searching for 5 walks all five. Y
