AlgoScope

AVL Delete with Rebalancing

Delete like a BST, then rebalance every ancestor. Unlike insert, several rotations may be needed.

Tree algorithms, algorithm, advanced
Found 90.510152527305055607590current

AVL Tree: Delete a leaf and rotate above it

Decision, step 2 of 7

Found 90 as the right child of 75. It is a leaf, so it is simply unlinked.

How avl tree works

Cost

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

Taught by the same lesson

AVL Tree covers these too, in the same run.