Abstract
When repeated updates are made to a binary search tree, the expected search cost tends to improve, as observed by Knott. For the case in which the updates use an asymmetric deletion algorithm, the Knott effect is swamped by the behavior discovered by Eppinger. The Knott effect applies also to updates using symmetric deletion algorithms, and it remains unexplained, along with several other trends in the tree distribution. It is believed that updates using symmetric deletion do not cause search cost to deteriorate, but the evidence is all experimental. The contribution of this paper is to model separately several different trends which may contribute to or detract from the Knott effect.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baeza-Yates, R.A.: A Trivial Algorithm Whose Analysis Is Not: A Continuation. BIT 29(3), 278–394 (1989)
Brinck, K.: On deletion in threaded binary trees. Journal of Algorithms 7(3), 395–411 (1986)
Culberson, J., Ian Munro, J.: Explaining the behavior of binary trees under prolonged updates: A model and simulations. The Computer Journal 32(1) (1989)
Culberson, J., Ian Munro, J.: Analysis of the standard deletion algorithms in exact fit domain binary search trees. Algorithmica 5(3), 295–311 (1990)
Evans, P.A., Culberson, J.: Asymmetry in binary search tree update algorithms. Technical Report TR 94-09, University of Alberta Department of Computer Science, Edmonton, Alberta, Canada (May 1994)
Eppinger, J.L.: An empirical study of insertion and deletion in binary trees. CACM 26(9), 663–669 (1983)
Gonnet, G.H., Baeza-Yates, R.: Handbook of Algorithms and Data Structures, 2nd edn. Addison-Wesley, Reading (1991)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison-Wesley, Reading (1989)
Hibbard, T.N.: Some combinatorial properties of certain trees with applications to searching and sorting. JACM 9, 13–28 (1962)
Jonassen, A.T., Knuth, D.E.: A trivial algorithm whose analysis isn’t. Journal of Computer and System Sciences 16, 301–322 (1978)
Knott, G.D.: Deletion in Binary Storage Trees. PhD thesis, Stanford University (1975); Available as Tech. Rep. STAN-CS-75-491
Knuth, D.E.: The Art of Computer Programming: Volume 3 / Sorting and Searching, 2nd edn. Addison-Wesley, Reading (1997)
Martinez, C., Roura, S.: Randomized binary search trees. JACM 45(2), 228–323 (1998)
Messeguer, X.: Dynamic behaviour in updating process over BST of size two with probabilistic deletion algorithms. IPL 38, 89–100 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Taylor, S. (2000). Emerging Behavior as Binary Search Trees Are Symmetrically Updated. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_8
Download citation
DOI: https://doi.org/10.1007/10719839_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67306-4
Online ISBN: 978-3-540-46415-0
eBook Packages: Springer Book Archive