The story
Named after Georgy Adelson-Velsky and Evgenii Landis, the inventors of this data structure.
Etymology from Wiktionary, CC BY-SA 4.0.
Today it means: A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one. Full definition →
Named after Georgy Adelson-Velsky and Evgenii Landis, the inventors of this data structure.
Etymology from Wiktionary, CC BY-SA 4.0.