article

Stratified balanced search trees

Authors:

Jan Leeuwen,

Mark H. OvermarsAuthors Info & Claims

Acta Informatica, Volume 18, Issue 4

Pages 345 - 359

https://doi.org/10.1007/BF00289574

Published: 01 January 1983 Publication History

Abstract

We develop a new perspective on trees, that enables us to distinguish and analyse many different subclasses of known classes of (height-)balanced search trees in a uniform manner. The approach shows that a great many different local constraints, including an arbitrary degree of density, can be enforced on everyday balanced search tree models, without losing the O(log n) bound on the time for insertions, deletions and finds. The theory extends known concepts from the study of B-trees.

References

[1]

Adel'son-Vel'skii, G.M., Landis, E.M.: An information organisation algorithm. Doklady Akad. Nauk SSSR 146 (1962) 263---266, transl. Soviet Math. Dokl. 3, 1259---1262 (1962)

Google Scholar

[2]

Bayer, R.: Symmetric binary B-trees: data structure and maintenance algorithms. Acta Informat. 1, 290---306 (1972)

Digital Library

Google Scholar

[3]

Bayer, R., McCreight, E.M.: Organisation and maintenance of large ordered indexes. Acta Informat. 1, 173---189 (1972)

Digital Library

Google Scholar

[4]

Culik II, K., Ottmann, Th., Wood, D.: Dense multiway trees. ACM Trans. Database Syst. 6, 486---512 (1981)

Digital Library

Google Scholar

[5]

Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. Proc. 19th Annual IEEE Symp. on Foundations of Computer Science, Ann. Arbor, Oct. 16---18, pp. 8---21, 1978

Digital Library

Google Scholar

[6]

Knuth, D.E.: The art of computer programming, vol. 3: sorting and searching. Addison-Wesley Publ. Comp., Reading, MA, 1973

Google Scholar

[7]

Kosaraju, S.R.: Insertion and deletion in one-sided height-balanced trees. C. ACM 21, 226---227 (1978)

Digital Library

Google Scholar

[8]

Olivié, H.: A study of balanced binary trees and balanced one-two trees. Ph.D. Thesis, Dept. of Mathematics, University of Antwerp (UIA), Antwerp, 1980

Google Scholar

[9]

Ottmann, Th., Wood, D.: Deletion in one-sided height-balanced search trees. Int. J. Comput. Math. 6, 265---271 (1978)

Crossref

Google Scholar

[10]

Zweben, S.H., McDonald, M.A.: An optimal method for deletion in one-sided height-balanced trees. C. ACM 21, 441---444 (1978)

Digital Library

Google Scholar

Cited By

View all

Haeupler BSen STarjan R(2015)Rank-Balanced TreesACM Transactions on Algorithms10.1145/268941211:4(1-26)Online publication date: 2-Jun-2015
https://dl.acm.org/doi/10.1145/2689412
Andersson AIcking CKlein ROttmann T(1990)Binary search trees of almost optimal heightActa Informatica10.5555/2697758.271151028:2(165-178)Online publication date: 1-Feb-1990
https://dl.acm.org/doi/10.5555/2697758.2711510
Aoe J(1990)A compendium of key search referencesACM SIGIR Forum10.1145/101306.10130824:3(26-42)Online publication date: 1-Nov-1990
https://dl.acm.org/doi/10.1145/101306.101308
Show More Cited By

Index Terms

Stratified balanced search trees

Index terms have been assigned to the content through auto-classification.

Recommendations

Rank-Balanced Trees

Since the invention of AVL trees in 1962, many kinds of binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing after an insertion or deletion takes O(1) amortized time and O(1) rotations worst-case. But the ...
Self-adjustingk-ary search trees and self-adjusting balanced search trees
Rank-Balanced Trees
WADS '09: Proceedings of the 11th International Symposium on Algorithms and Data Structures

Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing after an insertion or deletion takes O(1) amortized time and O(1) rotations ...

Comments

Information & Contributors

Information

Published In

Acta Informatica Volume 18, Issue 4

January 1983

130 pages

ISSN:0001-5903

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 January 1983

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Haeupler BSen STarjan R(2015)Rank-Balanced TreesACM Transactions on Algorithms10.1145/268941211:4(1-26)Online publication date: 2-Jun-2015
https://dl.acm.org/doi/10.1145/2689412
Andersson AIcking CKlein ROttmann T(1990)Binary search trees of almost optimal heightActa Informatica10.5555/2697758.271151028:2(165-178)Online publication date: 1-Feb-1990
https://dl.acm.org/doi/10.5555/2697758.2711510
Aoe J(1990)A compendium of key search referencesACM SIGIR Forum10.1145/101306.10130824:3(26-42)Online publication date: 1-Nov-1990
https://dl.acm.org/doi/10.1145/101306.101308
Huang S(1985)Height-balanced trees of order (β, γ, δ)ACM Transactions on Database Systems10.1145/3857.385810:2(261-284)Online publication date: 1-Jun-1985
https://dl.acm.org/doi/10.1145/3857.3858

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Rank-Balanced Trees

Self-adjustingk-ary search trees and self-adjusting balanced search trees

Rank-Balanced Trees

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations