✦ LIBER ✦

Height balanced 2–3 trees

✍ Scribed by V. K. Vaishnavi; H. P. Kriegel; D. Wood

Publisher: Springer Vienna
Year: 1979
Tongue: English
Weight: 606 KB
Volume: 21
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02253053

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

One-sided k-height-balanced trees

✍ Th. Ottmann; H. W. Six; D. Wood 📂 Article 📅 1979 🏛 Springer Vienna 🌐 English ⚖ 309 KB

On the expected height of fringe-balance

On the expected height of fringe-balanced trees

✍ Luc Devroye 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 329 KB

Height balance distribution of search tr

Height balance distribution of search trees

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

Height-analysis ofk-dimensional leaf and

Height-analysis ofk-dimensional leaf and node height-balanced trees: A new approach

✍ Vijay K. Vaishnavi; Timothy D. Korson 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 647 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

Stratified balanced search trees

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