Abstract
We derive an implementation in PASCAL of the insertion and deletion algorithms for 1–2 brother trees. The implementation is of interest not only in its own right but also in that it has given rise to an improved deletion algorithm.
Zusammenfassung
Es wird eine PASCAL-Implementierung der Einfüge- und Entferne-Algorithmen für 1–2-Bruder-Bäume entwickelt. Die Implementierung ist nicht nur an sich interessant, sondern führte darüberhinaus zu einer Verbesserung des Entferne-Algorithmus.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading, Mass.: Addison-Wesley 1974.
Hoare, C. A. R.: Recursive data structures. Int. Journal of Comp. and Inform. Sciences4, 105–132 (1975).
Jensen, K., Wirth, N.: PASCAL — user manual and report, 2nd ed. Berlin-Heidelberg-New York: Springer 1975.
Ottmann, Th., Wood, D.: 1–2 brother trees or AVL trees revisited. The Computer Journal23 (3), 248–255 (1980).
Wirth, N.: Algorithms+data structures=programs. Englewood Cliffs, N. J.: Prentice-Hall 1976.
Author information
Authors and Affiliations
Additional information
The work of the first author was partially supported by a grant from the Deutsche Forschungsgemeinschaft (DFG), that of the second author partially supported by a grant from the Deutscher Akademischer Austauschdienst (DAAD) and that of the third author supported by a grant from the Natural Sciences and Engineering Research Council of Canada, Grant No. A-7700.
Rights and permissions
About this article
Cite this article
Ottmann, T., Six, H.W. & Wood, D. The implementation of insertion and deletion algorithms for 1–2 brother trees. Computing 26, 367–378 (1981). https://doi.org/10.1007/BF02237956
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02237956