✦ LIBER ✦

Optimal Binary Search Trees with Restricted Maximal Depth

✍ Scribed by Garey, M. R.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal alphabetic search trees with res

✍ Russell L. Wessner 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 678 KB

Nearly optimal binary search trees

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

Maximal Flow in Branching Trees and Bina

✍ Federico Bassetti; Fabrizio Leisen 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 341 KB

Growing nearly optimal binary search tre

✍ James F. Korsh 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 484 KB

Optimal search trees and length restrict

✍ Å. Wikström 📂 Article 📅 1979 🏛 Springer Netherlands 🌐 English ⚖ 428 KB

Greedy binary search trees are nearly op

✍ James F. Korsh 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 442 KB