AVL Tree

An AVL tree is a self-balancing binary search tree named after its inventors, Adelson-Velsky and Landis. It ensures that the height difference between the left and right subtrees of any node does not exceed one, maintaining balance through rotations during insertions and deletions. This balancing mechanism guarantees logarithmic time complexity for search, insertion, and deletion operations.