Sciweavers

ISAAC
2003
Springer
134views Algorithms» more  ISAAC 2003»
14 years 5 months 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 ...
Travis Gagie