First page Back Continue Last page Summary Graphic
Removal from an AVL
Same idea!
- Perform a standard removal (splicing if necessary)
- Start at the splicing site & walk up the tree
- rebalance just like for insertions
Complexity analysis
- Cost of standard removal: O( )
- Depth of splicing site: O( )
- Number of iterations to walk up the tree: O( )
- Cost of a rebalancing: O( )
- Overall complexity: O( )