Adelson-Velsky and Landis Trees

A self-balancing binary search tree that uses rotations to maintain balances.

Key Concepts in AVL Trees

More Information

  1. Wikipedia
  2. GeeksforGeeks