AVL tree rotations

AVL tree rotations are adjustments made to maintain balance in a self-balancing binary search tree. When a node's left or right subtree becomes too tall compared to the other, rotations realign the nodes to restore balance. There are two main types: single rotations (left or right) that shift nodes, and double rotations (left-right or right-left), which are combinations of two single rotations. These modifications preserve the tree's ordered structure while ensuring operations like search, insert,, and delete remain efficient, usually in logarithmic time. Rotations are fundamental for keeping the tree optimized for quick data access.