Named after its inventors, Adelson-Velskii and Landis, an AVL tree is a self-balancing binary search tree.
