285 search results - page 1 / 57 » New Ways to Construct Binary Search Trees |
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
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 ...
SIGCSE
1996
ACM
13 years 8 months ago
1996
ACM
The Binary Search Tree serves as an important example when teaching data structures. We explore new approaches to understanding the implementation of a Binary Search Tree, using c...
ICSOFT
2007
13 years 5 months ago
2007
ACNS
2005
Springer
13 years 10 months ago
2005
Springer
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values speci...
VLDB
1999
ACM
13 years 8 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...