Sciweavers

Share
ISAAC
2003
Springer

New Ways to Construct Binary Search Trees

9 years 11 days ago
New Ways to Construct Binary Search Trees
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search tree given the rank by probability of each possible outcome, and height-restricting an optimal binary search tree when the increase in cost is restricted. Whereas most algorithms for constructing good binary search trees need the probabilities of outcomes as input, our algorithms do not.
Travis Gagie
Added 07 Jul 2010
Updated 07 Jul 2010
Type Conference
Year 2003
Where ISAAC
Authors Travis Gagie
Comments (0)
books