A right rotation lifts the left child above its parent. An AVL tree needs a single rotation for the LL and RR cases and a double rotation for LR and RL.
Tree rotation
A local rewiring of two or three nodes that changes the shape of a search tree but keeps its in-order sequence.