AVL Deletion Algorithm

• Recursive

1. Search downward for

node

2. Delete node

3. Unwind stack,

correcting heights

a. If imbalance #1,

single rotate

b. If imbalance #2,

double rotate

• Iterative

1. Search downward for

node, stacking

parent nodes

2. Delete node

3. Unwind stack,

correcting heights

a. If imbalance #1,

single rotate

b. If imbalance #2,

double rotate

Previous slide

Next slide

Back to first slide

View graphic version