01
AVL Trees and the First Self-Balancing Binary Search Tree
Adelson-Velsky and Landis showed in 1962 that a binary search tree could repair its own shape after updates, guaranteeing logarithmic search and insertion through local rotations.
↗
Collection