Abstract
We propose a framework for studying bottom-up restructuring heuristics for binary search trees. We identify the key role played by depth-reducing rules in obtaining logarithmic amortized cost per access. We show that splaying is by no means the only heuristic that offers logarithmic amortized cost.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Allen, B., Munro, I.: Self-organizing binary search trees. J. Assoc. Comput. Mach. 25 (1978) 526–535
Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. Assoc. Comput. Mach. 32 (1985) 652–686
Subramanian, A.: An explanation of splaying. Tech. Rep. IISc-CSA-93-03 (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Subramanian, A. (1994). An explanation of splaying. In: Thiagarajan, P.S. (eds) Foundation of Software Technology and Theoretical Computer Science. FSTTCS 1994. Lecture Notes in Computer Science, vol 880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58715-2_137
Download citation
DOI: https://doi.org/10.1007/3-540-58715-2_137
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58715-6
Online ISBN: 978-3-540-49054-8
eBook Packages: Springer Book Archive