This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bayer, R., Symmetric binary B-trees: data structure and maintenance algorithms, Acta Informatica 1(1972), 290–306.
Knuth, D.E., The art of computer programming, Vol. 3: Sorting and searching, Addison-Wesley, Reading, Mass., 1973.
Nievergelt, J. and Reingold, E.M., Binary search trees of bounded balance, SIAM J. Comput. 2, 1(March 1973), 33–43.
Olivié, H., A new class of balanced search trees: half-balanced binary search trees, Technical Report 80-02, Interstedelijke Industriele Hogeschool Antwerpen-Mechelen, Antwerp, June 1980, to appear in RAIRO-Informatique Théorique.
Olivié, H., A study of balanced binary trees and balanced one-two trees, Ph.D. thesis, Department of Mathematics, U.I.A., University of Antwerp, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olivié, H.J. (1981). On α-balanced binary search trees. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017302
Download citation
DOI: https://doi.org/10.1007/BFb0017302
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive