✦ LIBER ✦

The height of a random binary search tree

✍ Scribed by Reed, Bruce

Book ID: 125482048
Publisher: Association for Computing Machinery
Year: 2003
Tongue: English
Weight: 227 KB
Volume: 50
Category: Article
ISSN: 0004-5411
DOI: 10.1145/765568.765571

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The height of a random binary search tre

The height of a random binary search tree

✍ Reed, Bruce 📂 Article 📅 2003 🏛 Association for Computing Machinery 🌐 English ⚖ 227 KB

On the Variance of the Height of Random

On the Variance of the Height of Random Binary Search Trees

✍ Devroye, Luc; Reed, Bruce 📂 Article 📅 1995 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 522 KB

Randomized binary search trees

✍ Martínez, Conrado; Roura, Salvador 📂 Article 📅 1998 🏛 Association for Computing Machinery 🌐 English ⚖ 314 KB

Binary search trees of almost optimal he

Binary search trees of almost optimal height

✍ Arne Andersson; Christian Icking; Rolf Klein; Thomas Ottmann 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 739 KB

On the Total Heights of Random Rooted Bi

On the Total Heights of Random Rooted Binary Trees

✍ L. Takacs 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 306 KB

Denote by \(S_{n}\) the set of all distinct rooted binary trees with \(n\) unlabeled vertices. Define \(\sigma_{n}\) as a total height of a tree chosen at random in the set \(S_{n}\), assuming that all the possible choices are equally probable. The total height of a tree is defined as the sum of the

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