AVL tree

An AVL tree is a type of self-balancing binary search tree in computer science. It maintains sorted data while ensuring that the tree's height remains balanced, meaning no branch is significantly longer than others. This balance is crucial for efficient searching, inserting, and deleting of items, as it guarantees that operations can be completed in O(log n) time, where n is the number of nodes. The name "AVL" comes from its inventors, Georgy Adelson-Velsky and Evgenii Landis, who introduced it in 1962. In essence, it optimizes performance while keeping data organized.