AlgoScope

Left Rotation

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

Tree algorithms, algorithm, intermediate
Node 10 has balance -1. It is fine.1020current
Node 10 has balance -1. It is fine.1020current

AVL Tree: Right-right needs a left rotation

Decision, step 6 of 12

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

How avl tree works

Cost

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

Leads to

Topics that need this one first.

Taught by the same lesson

AVL Tree covers these too, in the same run.