✦ LIBER ✦

On growing random binary trees

✍ Scribed by Boris Pittel

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 841 KB
Volume: 103
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(84)90141-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating binary trees at random

✍ M.D. Atkinson; J.-R. Sack 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 260 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

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

On binary search trees

✍ Roberto De Prisco; Alfredo De Santis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Random walks on trees

✍ Lynn Hauser Pearce 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 267 KB

The classical gambler's ruin problem, i.e., a random walk along a line may be viewed q raph theoretically as a random walk along a path with the endpoints as absorbing states. This paper is an i0vestigation of the natural generalization of this problem to that of a particle walking randomly on a tre

On the distribution of binary search tre

On the distribution of binary search trees under the random permutation model

✍ James Allen Fill 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 865 KB

We study the distribution Q on the set B, of binary search trees over a linearly ordered set of n records under the standard random permutation model. This distribution also arises as the stationary distribution for the move-to-root (MTR) Markov chain taking values in B,, when successive requests ar