✦ LIBER ✦

On the expected height of fringe-balanced trees

✍ Scribed by Luc Devroye

Publisher: Springer-Verlag
Year: 1993
Tongue: English
Weight: 329 KB
Volume: 30
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf01210596

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On rotations in fringe-balanced binary t

On rotations in fringe-balanced binary trees

✍ Hosam M. Mahmoud 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 451 KB

We employ a P6lya urn to model rotations in a random fringe-balanced binary search tree. We show that asymptotically the number of rotations to construct a tree of size n has a normal distribution with mean +n and variance sn. Exact results for mean and variance are developed in the process. @ 1998

One-sided k-height-balanced trees

✍ Th. Ottmann; H. W. Six; D. Wood 📂 Article 📅 1979 🏛 Springer Vienna 🌐 English ⚖ 309 KB

A note on the expected path length of tr

A note on the expected path length of trees with known fringe

✍ Roberto De Prisco; Giuseppe Parlati; Giuseppe Persiano 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 480 KB

Height balance distribution of search tr

Height balance distribution of search trees

✍ Ricardo A. Baeza-Yates 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 786 KB

An analytic approach for the analysis of

An analytic approach for the analysis of rotations in fringe-balanced binary search trees

✍ Alois Panholzer; Helmut Prodinger 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 527 KB

The Height of Increasing Trees

✍ Michael Drmota 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 466 KB