✦ LIBER ✦

Bounds on the weighted path length of binary trees

✍ Scribed by J. Nievergelt; J. Pradels; C.K. Wong; P.C. Yue

Book ID: 113161677
Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 708 KB
Volume: 1
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(72)90015-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Best Possible Bound for The Weighted P

A Best Possible Bound for The Weighted Path Length of Binary Search Trees

✍ Mehlhorn, Kurt 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 366 KB

On the Joint Path Length Distribution in

On the Joint Path Length Distribution in Random Binary Trees

✍ Charles Knessl; Wojciech Szpankowski 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 352 KB

Internal path length of the binary repre

Internal path length of the binary representation of heap-ordered trees

✍ Wen-Chin Chen; Wen-Chun Ni 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 245 KB

New lower bounds on the cost of binary s

New lower bounds on the cost of binary search trees

✍ Roberte De Prisco; Alfredo De Santis 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 674 KB

On line disjoint paths of bounded length

✍ Geoffrey Exoo 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 105 KB

In a recent paper Lovfisz, Neumann-Lara and Plummer proved some Mengerian theorems for paths of bounded length. In this note the line connectivity analogue of their problem "is considered. In [3] Lovfisz, Neumann-Lara and Plummer considered the problem of extending Monger's theorem to paths of boun

A note on the path length of red–black t

A note on the path length of red–black trees

✍ Helen Cameron; Derick Wood 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 443 KB