𝔖 Bobbio Scriptorium
✦   LIBER   ✦

One-sided k-height-balanced trees

✍ Scribed by Th. Ottmann; H. W. Six; D. Wood

Publisher
Springer Vienna
Year
1979
Tongue
English
Weight
309 KB
Volume
22
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Height balanced 2–3 trees
Height balanced 2–3 trees
✍ V. K. Vaishnavi; H. P. Kriegel; D. Wood 📂 Article 📅 1979 🏛 Springer Vienna 🌐 English ⚖ 606 KB
General Balanced Trees
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

Balanced Aspect Ratio Trees: Combining t
Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees
✍ Christian A. Duncan; Michael T. Goodrich; Stephen Kobourov 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 273 KB

Given a set S of n points on ‫ޒ‬ d , we show, for fixed d, how to construct in Ž . Ž . O n log n time a data structure we call the balanced aspect ratio BAR tree. A Ž . BAR tree is a binary space partition tree on S that has O log n depth in which Ž . every region is convex and ''fat'' that is, has