✦ LIBER ✦

Insertion-safeness in balanced trees

✍ Scribed by H.P. Kriegel; Y.S. Kwong

Book ID: 113162603
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 403 KB
Volume: 16
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(83)90100-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

General Balanced Trees

✍ Arne Andersson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 117 KB

We show that, in order to achieve efficient maintenance of a balanced binary search tree, no shape restriction other than a logarithmic height is required. The obtained class of trees, general balanced trees, may be maintained at a logarithmic amortized cost with no balance information stored in the

Embedding height balanced trees and Fibo

Embedding height balanced trees and Fibonacci trees in

✍ S. A. Choudum; Indhumathi Raman 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 610 KB

Height-balanced multiway trees

✍ Linda Pagli 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 776 KB

Randomly balanced binary trees

✍ R. Sprugnoli 📂 Article 📅 1980 🏛 Springer Milan 🌐 English ⚖ 870 KB

Stratified balanced search trees

✍ Jan Leeuwen; Mark H. Overmars 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 731 KB

Balance in trees

✍ K.B. Reid; E. DePalma 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 150 KB