✦ LIBER ✦

Left and Right Pathlengths in Random Binary Trees

✍ Scribed by Svante Janson

Book ID: 106148659
Publisher: Springer
Year: 2006
Tongue: English
Weight: 197 KB
Volume: 46
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-006-0099-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Profiles of Random Trees: Limit Theorems

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees

✍ Michael Fuchs; Hsien-Kuei Hwang; Ralph Neininger 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 469 KB

Growing binary trees in a random environ

Growing binary trees in a random environment

✍ Kessler, I.; Sidi, M. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 472 KB

Left and Right Length of Paths in Binary

Left and Right Length of Paths in Binary Trees or on a Question of Knuth

✍ Alois Panholzer 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 333 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

Distribution of Distances in Random Bina

Distribution of Distances in Random Binary Search Trees

✍ Hosam M. Mahmoud and Ralph Neininger 📂 Article 📅 2003 🏛 Institute of Mathematical Statistics 🌐 English ⚖ 447 KB