✦ LIBER ✦

On the average internal path length ofm-ary search trees

✍ Scribed by Hosam M. Mahmoud

Publisher: Springer-Verlag
Year: 1986
Tongue: English
Weight: 265 KB
Volume: 23
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00268078

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Number of t-Ary Trees with a Give

On the Number of t-Ary Trees with a Given Path Length

✍ Gadiel Seroussi 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 190 KB

On the internal path length of d-dimensi

On the internal path length of d-dimensional quad trees

✍ Ralph Neininger; Ludger Rüschendorf 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

It is proved that the internal path length of a d-dimensional quad tree after normalization converges in distribution. The limiting distribution is characterized as a fixed point of a random affine operator. We obtain convergence of all moments and of the Laplace transforms. The moments of the limit

On the variance of the internal path len

On the variance of the internal path length of generalized digital trees – The Mellin convolution approach

✍ Friedrich Hubalek 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 244 KB

On the joint distribution of the inserti

On the joint distribution of the insertion path length and the number of comparisons in search trees

✍ Hosam M. Mahmoud; Boris Pittel 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 786 KB