✦ LIBER ✦

A note on growing binary trees

✍ Scribed by Alan G. Konheim; Donald J. Newman

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On growing random binary trees

✍ Boris Pittel 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 841 KB

Growing binary trees in a random environ

✍ Kessler, I.; Sidi, M. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 472 KB

A note on binary grammatical codes of tr

✍ Andrzej Ehrenfeucht; Paulien ten Pas; Grzegorz Rozenberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 916 KB

Growing nearly optimal binary search tre

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

A note on traversal algorithms for tripl

✍ T. I. Fenner; G. Loizou 📂 Article 📅 1981 🏛 Springer Netherlands 🌐 English ⚖ 173 KB

A note on multikey sorting using modifie

✍ Abid M. Elabdalla 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 491 KB