✦ 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
DOI: 10.1007/bf00269807

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