Abstract
We characterize node-visit optimal 1–2 brother trees and present a linear time algorithm to construct them.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Adelson-Velskii, G.M. and Landis, Y.M.: An algorithm for the organization of information, Doklady Akademij Nauk SSSR 146, 1962, 263–266.
Aho, A.V., Hopcroft, J.E., and Ullman, J.D.: The design and analysis of computer algorithms, Addison-Wesley, Reading Mass., 1974.
Miller, R., Pippenger, N., Rosenberg, A., and Snyder, L.: Optimal 2,3-trees. IBM Res. Rep. RC 6505, 1977, to appear in SIAM J.Comp.
Ottmann, Th., and Six, H.W.: Eine neue Klasse von Binärbäumen. Angewandte Informatik 8, 1976, 395–400.
Ottmann, Th., Six, H.W., and Wood, D.: Right brother trees. Comm. ACM 21, 1978, 769–776.
Ottmann, Th., and Wood, D.: 1–2 brother trees or AVL trees revisited, To appear in The Computer Journal.
Ottmann, Th., Rosenberg, A.L., Six, H.W., and Wood, D.: Minimal-Cost Brother Trees, Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Report 73, Karlsruhe, 1978.
Rosenberg, A., and Snyder, L.: Minimum comparison 2, 3 trees, IBM Res. Rep. RC6551, 1977. To appear in SIAM J.Comp.
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ottmann, T., Rosenberg, A.L., Six, H.W., Wood, D. (1979). Node-visit optimal 1 – 2 brother trees. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_23
Download citation
DOI: https://doi.org/10.1007/3-540-09118-1_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09118-9
Online ISBN: 978-3-540-35517-5
eBook Packages: Springer Book Archive