Explain the 4 types of Rotations in AVL Tree (LL, RR, LR, RL) to maintain Balance Factor.

When I was studying data structures, AVL rotations felt confusing until I started visualizing them. Basically, these rotations help maintain balance in a binary search tree after insertion.

• LL (Left-Left) happens when nodes are added to the left side repeatedly, and it’s fixed using a right rotation.
• RR (Right-Right) is the opposite, fixed with a left rotation.
• LR (Left-Right) and RL (Right-Left) are more complex cases where double rotations are needed.

What helped me understand better was drawing diagrams instead of just reading theory. Once you see how imbalance occurs and how rotations fix it, the concept becomes much clearer. It’s more about understanding structure than memorizing definitions.