3 search results - page 1 / 1 » Average-case analysis of QuickSort and Binary Insertion Tree... |
IPL
2007
13 years 7 months ago
2007
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
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...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...