Recall the four possible imbalance cases in an AVL tree (LL, RR, LR, RL) and the corresponding rotations needed to fix them.

After inserting a node, trace the path from the inserted node back to the root, updating heights and checking balance factors at each step.

Implement the insertion recursively, then handle rotations by carefully updating the root pointers of the affected subtrees while maintaining the BST property.