Adelson-Velsky and Landis

E2172201 UNEXPLORED

Adelson-Velsky and Landis are Soviet computer scientists known for introducing the self-balancing binary search tree data structure now called the AVL tree.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Adelson-Velsky and Landis canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

AVL tree → namedAfter → Adelson-Velsky and Landis ⓘ