19 search results - page 1 / 4 » The height of q-Binary Search Trees |
DMTCS
2002
15 years 27 days ago
2002
Abstract. q
118
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
150
Voted
ALGORITHMICA
2006
15 years 1 months ago
2006
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
133
Voted
DAGSTUHL
2007
15 years 2 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
95
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...