Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ISAAC
2003
Springer

favoriteEmaildiscussreport

134views Algorithms» more ISAAC 2003»

New Ways to Construct Binary Search Trees

13 years 9 months ago

New Ways to Construct Binary Search Trees

Download www.cs.ust.hk

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

Real-time Traffic

Binary Search Trees | ISAAC 2003 | Linear-time Algorithms | Optimal Binary Search |

claim paper

Related Content

» Thinking about binary trees in an objectoriented world

» On Digital Search Trees A Simple Method for Constructing Balanced Binary Trees

» Indexing Information for Data Forensics

» Cache Conscious Indexing for DecisionSupport in Main Memory

» Generalization of Binary Search Searching in Trees and ForestLike Partial Orders

» Subtree Sizes in Recursive Trees and Binary Search Trees BerryEsseen Bounds and Poisson Ap...

» Searching large indexes on tiny devices optimizing binary search with character pinning

» Large Deviations for the Weighted Height of an Extended Class of Trees

» New hyperspectral data representation using binary partition tree

Post Info
More Details (n/a)

Added	07 Jul 2010
Updated	07 Jul 2010
Type	Conference
Year	2003
Where	ISAAC
Authors	Travis Gagie

Comments (0)