✦ LIBER ✦

Stratified balanced search trees

✍ Scribed by Jan Leeuwen; Mark H. Overmars

Publisher: Springer-Verlag
Year: 1983
Tongue: English
Weight: 731 KB
Volume: 18
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00289574

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Height balance distribution of search tr

Height balance distribution of search trees

✍ Ricardo A. Baeza-Yates 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 786 KB

Purely top-down updating algorithms for

Purely top-down updating algorithms for stratified search trees

✍ Thomas Ottmann; Michael Schrapp; Derick Wood 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 779 KB

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

Relaxed balance for search trees with lo

Relaxed balance for search trees with local rebalancing

✍ Kim S. Larsen; Thomas Ottmann; Eljas Soisalon-Soininen 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 139 KB

A balanced search tree withO(1) worst-ca

A balanced search tree withO(1) worst-case update time

✍ Christos Levcopoulos; Mark H. Overmars 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 687 KB

Worst-case analysis for region and parti

Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees

✍ D. T. Lee; C. K. Wong 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 357 KB