Abstract
We consider the problem of maintaing a random binary search tree under insertions and deletions under the conditions that (i) no extra permanent storage space be used besides the tree itself, and (ii) that at any point in time the tree be perfectly random, meaning that it is drawn from the ideal binary search tree distribution. We present a simple solution to this problem with an expected deletion time of O(logn) and expected insertion time of O(log2 n) time.
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
Aragon, C.R., Seidel, R.G.: Randomized Search Trees. In: Proc. IEEE Symp. FOCS, pp. 540–545 (1989)
Bent, S.W., Driscoll, J.R.: Randomly balanced search trees (manuscript, 1991)
Eppinger, J.L.: An Empirical Study of Insertion and Deletion in Binary Search Trees. Commun. ACM 26(9), 663–669 (1983)
Heyer, M.: Randomness Preserving Deletions on Special Binary Search Trees. M.Sc. Thesis, Dept. of Computer Science, Nat. Univ. of Ireland, Cork (2005)
Knott, G.D.: Deletions in Binary Storage Trees. PhD Thesis, Computer Science Dept., Stanford Univ. (1975)
Jonassen, A.T., Knuth, D.E.: A Trivial Algorithm Whose Analysis Isn’t. J. Comput. Syst. Sci. 16(3), 301–322 (1978)
Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol. III. Addison-Wesley, Reading (1973)
Knuth, D.E.: Deletions That Preserve Randomness. IEEE Trans. Software Eng. 3(5), 351–359 (1977)
Martínez, C., Roura, S.: Randomized Binary Search Trees. J. ACM 45(2), 288–323 (1998)
Mehlhorn, K.: Data Structures and Algorithms 3. Springer, Heidelberg (1984)
Mehlhorn, K.: A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions. SIAM J. on Comput. 11(4), 748–760 (1982)
Pugh, W.: Skip Lists: A Probabilistic Alternative to Balanced Trees. Commun. ACM 33(6), 668–676 (1990)
Seidel, R., Aragon, C.R.: Randomized Search Trees. Algorithmica 16(4/5), 464–497 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Seidel, R. (2009). Maintaining Ideally Distributed Random Search Trees without Extra Space. In: Albers, S., Alt, H., Näher, S. (eds) Efficient Algorithms. Lecture Notes in Computer Science, vol 5760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03456-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-03456-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03455-8
Online ISBN: 978-3-642-03456-5
eBook Packages: Computer ScienceComputer Science (R0)