✦ LIBER ✦

One-sided variations on binary search trees

✍ Scribed by Hosam M. Mahmoud

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On binary search trees

✍ Roberto De Prisco; Alfredo De Santis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 378 KB

A note on searching in a binary search t

✍ Arne Andersson 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

The estimated cost of a search tree on b

✍ Fedotov, A.; Ryabko, B. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 112 KB

On the max-entropy rule for a binary sea

✍ Yasuichi Horibe; Tibor O. H. Nemetz 📂 Article 📅 1979 🏛 Springer-Verlag 🌐 English ⚖ 427 KB

New lower bounds on the cost of binary s

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

Least upper bound on the cost of optimum

✍ T. C. Hu; K. C. Tan 📂 Article 📅 1972 🏛 Springer-Verlag 🌐 English ⚖ 201 KB