Sciweavers

SODA
2010
ACM
196views Algorithms» more  SODA 2010»
15 years 10 days ago
Deletion Without Rebalancing in Balanced Binary Trees
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
Siddhartha Sen, Robert E. Tarjan