Abstract
This chapter presents the unbounded form of height-balanced binary search tree further described in §6.1. The interface is also presented in §6.1 while its implementation follows in §6.2. The chapter concludes with a utility module in §6.3 and §6.4.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms, Addison- Wesley, Reading, MA 1983.
G. Booch, Software Components in Ada Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987.
G.H. Gönnet, Handbook of Algorithms and Data Structures, Addison-Wesley, Reading, MA 1984.
K. John Gough, Writing Generic Utilities in Modula-2. Journal of Pascal, Ada, and Modula-2, Vol. 5(3), (May/June 1986 ), pp 53–62.
T.A. Standish, Data Structure Techniques, Addison-Wesley, Reading, MA 1980.
R.S. Wiener and G. A. Ford, Modula-2 A Software Development Approach, John Wiley & Sons, New York, NY 1985.
R.S. Wiener and R.F. Sincovec, Data Structures Using Modula-2, John Wiley & Sons, New York, NY 1986.
N. Wirth, Algorithms and Data Structures, Prentice-Hall, Englewood Cliffs, NJ 1986.
N. Wirth, Programming in Modula-2, 3rd. corrected edition, Springer-Verlag, New York, NY 1985.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Lins, C. (1989). The Unbounded AVL Tree. In: The Modula-2 Software Component Library. Springer Compass International. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-6386-6_7
Download citation
DOI: https://doi.org/10.1007/978-1-4684-6386-6_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-6388-0
Online ISBN: 978-1-4684-6386-6
eBook Packages: Springer Book Archive