✦ LIBER ✦

Binary search trees of almost optimal height

✍ Scribed by Arne Andersson; Christian Icking; Rolf Klein; Thomas Ottmann

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nearly optimal binary search trees

✍ Kurt Mehlhorn 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 329 KB

On the costs of optimal and near-optimal

✍ Brian Allen 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 347 KB

The optimal binary search tree for Ander

✍ David Spuler 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 122 KB

Height balance distribution of search tr

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

Generating binary trees of bounded heigh

✍ C. C. Lee; D. T. Lee; C. K. Wong 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 707 KB

A subquadratic algorithm for constructin

✍ Lawrence L Larmore 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 732 KB