THE LIVING ARCHIVE

From punched cards to autonomous collaborators: the ideas, people, languages and systems that taught machines to follow—and increasingly interpret—human intent.

PAST / PRESENT / NEXT

Collection

Tag: binary-search-tree

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.

↗