Abstract
This paper presents an optimization to an insertion algorithm for nearly complete binary search trees. The original algorithm was published recently by T.E. Gerasch in the Communications of the ACM ([Ger88]). Its insertion time is logarithmic in the best case, and linear in the worst case. With the optimization proposed here, some insertions that would require linear time with Gerasch's algorithm are handled in logarithmic time. The proposed optimization does not modify the worst case nor the best case behaviour of the algorithm.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Thomas E. Gerasch. An insertion algorithm for a minimal internal path length binary search tree. CACM, 31(5):579–585, May 1988.
Isabelle Richard and Elie Milgrom. Optimization at a high level of abstraction. Research Report RR88-24, U.C.L., Unité d'Informatique, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Richard, I., Milgrom, E. (1989). Optimization at a high level of abstraction. In: Litwin, W., Schek, HJ. (eds) Foundations of Data Organization and Algorithms. FODO 1989. Lecture Notes in Computer Science, vol 367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51295-0_135
Download citation
DOI: https://doi.org/10.1007/3-540-51295-0_135
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51295-0
Online ISBN: 978-3-540-46186-9
eBook Packages: Springer Book Archive