Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Hopcroft, J.E., and Ullman, J.D.: The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., (1974).
Bayer, R. and McCreight, E.: Organization and Maintenance of Large Ordered Indexes, Acta Informatica 1, 1972, 173–189.
Culik II, K., Ottmann, Th., and Wood, D.: Dense multiway trees, Report 77, Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, 1978.
Knuth, D.: The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, Mass., (1973).
Kwong, Y.S. and Wood, D.: T-Trees: A variant of B-trees, Computer Science Technical Report 78-CS-18, McMaster University, Hamilton, Ontario, 1978.
Ottmann, Th. and Wood, D.: 1–2 brother trees or AVL trees revisited, to appear in Computer Journal (1979).
Yao, A.: On random 2,3 trees, Acta Informatica 9, 1978, 159–170.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ottmann, T., Wood, D. (1979). A uniform approach to balanced binary and multiway trees. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_39
Download citation
DOI: https://doi.org/10.1007/3-540-09526-8_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09526-2
Online ISBN: 978-3-540-35088-0
eBook Packages: Springer Book Archive