AVL Tree

An AVL tree is a self-balancing binary search tree. It ensures that the height difference between the left and right subtrees of any node does not exceed 1. This balancing maintains logarithmic time complexity for search, insertion, and deletion operations, preventing worst-case scenarios in unbalanced trees.