✦ LIBER ✦

Fibonacci BSTs: A new balancing method for binary search trees

✍ Scribed by Roura, Salvador

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Binary search networks: A new method for

✍ Toshitsugu Yuba; Mamoru Hoshi 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 539 KB

A method for constructing binary search

✍ C. J. Stephenson 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 641 KB

A function for generating nearly balance

✍ R. A. Frost; M. M. Peterson 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB

Compressed Binary Bit Trees: A New Data

✍ Smellie, Andrew 📂 Article 📅 2009 🏛 American Chemical Society 🌐 English ⚖ 452 KB

An efficient compression scheme for data

✍ Luis Rueda; B. John Oommen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB

[Lecture Notes in Computer Science] Fron

✍ Preparata, Franco P.; Fang, Qizhi 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 392 KB