✦ LIBER ✦

A note on searching in a binary search tree

✍ Scribed by Arne Andersson

Book ID: 112210622
Publisher: John Wiley and Sons
Year: 1991
Tongue: English
Weight: 233 KB
Volume: 21
Category: Article
ISSN: 0038-0644
DOI: 10.1002/spe.4380211009

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

A new representation of binary search tr

A new representation of binary search trees

✍ Si-Qing Zheng 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 462 KB

Distances and Finger Search in Random Bi

Distances and Finger Search in Random Binary Search Trees

✍ Devroye, Luc; Neininger, Ralph 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 173 KB

One-sided variations on binary search tr

One-sided variations on binary search trees

✍ Hosam M. Mahmoud 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 789 KB

Binary search trees in secondary memory

✍ William E. Wright 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 823 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