Randomized Binary Search Trees

Journal of the ACM

Volumn 45, Issue 2, 1998, Pages 288-323

  Martínez, Conrado ^a   Roura, Salvador ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Algorithms; Balanced trees; E.1 Data Structures ; F.2 Analysis of Algorithms and Problem Complexity ; Probabilistic algebraic specification; Randomized data structures; Search trees; Self organizing data structures; Theory

Indexed keywords

ALGEBRA; DATA REDUCTION; DATA STRUCTURES; PROBABILITY; RANDOM PROCESSES; STORAGE ALLOCATION (COMPUTER); TREES (MATHEMATICS);

PROBABILISTIC ALGEBRAIC SPECIFICATIONS; RANDOM BINARY SEARCH TREES; RANDOMIZED DATA STRUCTURES; SELF ORGANIZING DATA STRUCTURES;

ALGORITHMS;

EID: 0032025296     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/274787.274812     Document Type: Article

References (28)

1. ADEL'SON-VEL'SKII, G., AND LANDIS, E. 1962. An algorithm for the organization of information. Dokl. Akad. Nauk SSSR 146, 2, 263-266. (English translation in Soviet Math. Doklay 3, 1259-1263.)
2. ADEL'SON-VEL'SKII, G., AND LANDIS, E. 1962. An algorithm for the organization of information. Dokl. Akad. Nauk SSSR 146, 2, 263-266. (English translation in Soviet Math. Doklay 3, 1259-1263.)
3. ALLEN, B., AND MUNRO, J. 1978. Self-organizing search trees. J. ACM 25, 4, 526-535.
4. ARAGON, C. R., AND SEIDEL, R. G. 1989. Randomized search trees. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, New York, pp. 540-545.
5. BAEZA-YATES, R. 1986. A trivial algorithm whose analysis isn't: A continuation. Tech. Rep. CS-86-67. Dept. of Computer Science, University of Waterloo, Waterloo, Ind.
6. CULBERSON, J. 1985. The effect of updates in binary search trees. In Proceedings of the 17th ACM Symposium on the Theory of Computing (STOC) (Providence, R.I., May 6-8). ACM, New York, pp. 205-212.
7. EPPINGER, J. L. 1983. An empirical study of insertion and deletion in binary search trees. Commun. ACM 26 9 (Sept.), 663-669.
8. FELLER, W. 1968. An Introduction to Probability Theory and its Applications, vol. I. Wiley, New York.
9. GONNET, G., OLIVIE, H., AND WOOD, D. 1983. Height-ratio-balanced trees. Comput. J. 26, 2 106-108.
10. GONNET, G. H., AND BAEZA-YATES, R. 1991. Handbook of Algorithms and Data Structures-In Pascal and C. 2nd ed. Addison-Wesley, Reading, Mass.
11. GUIBAS, L., AND SEDGEWICK, R. 1978. A dichromatic framework for balanced trees. In Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (Oct.). IEEE, New York, 8-12.
12. HIBBARD, T. N. 1962. Some combinatorial properties of certain trees with applications to searching and sorting. J. ACM 9, 1 (Jan.), 13-18.
13. JONASSEN, A., AND KNUTH, D. 1978. A trivial algorithm whose analysis isn't. J. Comput. Syst. Sci. 16, 3, 301-322.
14. KNOTT, G. D. 1975. Deletions in Binary Storage Trees. Ph.D dissertation. Computer Science Dept., Stanford University, Stanford, Calif.
15. KNUTH, D. E. 1973. The Art of Computer Programming: Sorting and Searching, vol. 3. Addison-Wesley, Reading, Mass.
16. KNUTH, D. 1977. Deletions that preserve randomness. IEEE Trans. Softw. Eng. 3, 351-359.
17. KOZEN, D. C. 1992. The Design and Analysis of Algorithms. Springer-Verlag, New York.
18. MAHMOUD, H. M. 1992. Evolution of Random Search Trees. Wiley Interscience, New York.
19. MARTÍNEZ, C., AND MESSEGUER, X. 1990. Deletion algorithms for binary search trees. Tech. Rep. LSI-90-39 Dept. LSI, Univ. Politècnica Catalunya, Barcelona, Spain.
20. NIEVERGELT, J., AND REINGOLD, E. 1973. Binary search trees of bounded balance. SIAM J. Comput. 2, 1, 33-43.
21. PUGH, W. 1990. Skip lists: A probabilistic alternative to balanced trees. Commun. ACM 33, 6 (June), 668-676.
22. RAGHAVAN, P., AND MOTWANI, R. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, Mass.
23. ROURA, S., AND MARTÍNEZ, C. 1996. Randomization of search trees by subtree size. In Proceedings of the 4th European Symposium on Algorithms (ESA), J. Díaz and M. Serna, eds. Lecture Notes in Computer Science, vol. 1136. Springer-Verlag, New York, pp. 91-106.
24. SEDGEWICK, R. 1988. Algorithms, 2nd ed. Addison-Wesley, Reading, Mass.
25. SEDGEWICK, R., AND FLAJOLET, P. 1996. An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading, Mass.
26. SEIDEL, R., AND ARAGON, C. 1996. Randomized search trees. Algorithmica 16, 464-497.
27. STEPHENSON, C. J. 1980. A method for constructing binary search trees by making insertions at the root. Int. J. Comput. Inf. Sci. 9 1.
28. VITTER, J. S., AND FLAJOLET, P. 1990. Average-case analysis of algorithms and data structures. In Handbook of Theoretical Computer Science, chap. 9, J. van Leeuwen, ed. North-Holland, Amsterdam, The Netherlands.