Left Rotation

AlgorithmintermediateAVL Tree

The right child comes up and the old node drops to its left.

Decision · step 6 of 12AVL Tree: Right-right needs a left rotation

At 10: left height 0, right height 1, balance -1. Within one, so it stays.

Open in the player →or start at step 6

What you will see

Three nodes pivot; one edge changes owner; inorder sequence is unchanged.

How avl tree works →

Cost

Best	`O(1)`
Average	`O(1)`
Worst	`O(1)`
Space	`O(1)`

How you work with it here

play it through, step one change at a time, scrub to any step, run it on your own input, predict what happens next, try operations in any order.

Screen readers: Nodes announce value, left child and right child; each step announces the comparison and the direction taken or the structural change.

Reduced motion: Focus jumps node to node with a static ring; rotations become a crossfade between the two layouts.

Before this

Balance Factor

Right Rotation

Leads to

Topics that need this one first.

Left-Right and Right-Left Rotations

Taught by the same lesson

AVL Tree covers these too, in the same run.

AVL Tree AVL Insert with Rebalancing Balance Factor Left-Right and Right-Left Rotations Right Rotation AVL Delete with Rebalancing