𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Binary search trees in secondary memory

✍ Scribed by William E. Wright


Publisher
Springer-Verlag
Year
1980
Tongue
English
Weight
823 KB
Volume
15
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On binary search trees
✍ Roberto De Prisco; Alfredo De Santis πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 378 KB
Optimum binary search trees
✍ Donald E. Knuth πŸ“‚ Article πŸ“… 1972 πŸ› Springer-Verlag 🌐 English βš– 39 KB
Optimum binary search trees
✍ D. E. Knuth πŸ“‚ Article πŸ“… 1971 πŸ› Springer-Verlag 🌐 English βš– 510 KB
Chromatic binary search trees
✍ Otto Nurmi; Eljas Soisalon-Soininen πŸ“‚ Article πŸ“… 1996 πŸ› Springer-Verlag 🌐 English βš– 705 KB
Chromatic binary search trees
✍ Otto Nurmi; Eljas Soisalon-Soininen πŸ“‚ Article πŸ“… 1996 πŸ› Springer-Verlag 🌐 English βš– 103 KB
Patterns in random binary search trees
✍ Philippe Flajolet; Xavier Gourdon; Conrado MartΓ­nez πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 243 KB

In a randomly grown binary search tree BST of size n, any fixed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantified by a Gaussian law. Trees with forbidden patterns occur with an exponentially small probabilit