Rotation is the operation used to restore balance in AVL trees.

Insertion: at most 2 rotations (1 not always enough).

Deletion: fixing imbalance at one node may create imbalance higher up in the tree. Worst case O(Height) rotations.