Advertisement

Randomization of search trees by subtree size

  • Salvador Roura
  • Conrado Martínez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1136)

Abstract

In this paper we present randomized algorithms over binary search trees such that: a) the insertion of a set of keys in any fixed order into an initially empty tree always produces a random binary search tree; b) the deletion of any key from a random binary search tree results in a random binary search tree; c) the random choices made by the algorithms are based upon the sizes of the subtrees of the tree; this will imply that we will be able to support accesses by rank without additional storage requirements or modification of the data structures; and d) the cost of any elementary operation, measured as the number of visited nodes, is the same as the expected cost of its standard deterministic counterpart; hence, all operations have thus guaranteed expected cost O(log n), but now irrespective of any assumption on the input distribution.

Keywords

Search Tree Deterministic Algorithm Binary Search Tree 30th Annual IEEE Symposium Left Subtree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    B. Allen and J. Munro. Self-organizing search trees. J. ACM, 25(4):526–535, Oct. 1978.Google Scholar
  2. 2.
    C. R. Aragon and R. G. Seidel. Randomized search trees. In Proc. of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Research Triangle Park, NC, pages 540–545, 1989.Google Scholar
  3. 3.
    L. Devroye. A note on the height of binary search trees. J. ACM, 33(3):489–498, July 1986.Google Scholar
  4. 4.
    T. N. Hibbard. Some combinatorial properties of certain trees with applications to searching and sorting. J. ACM, 9(1):13–18, 1962.Google Scholar
  5. 5.
    G. D. Knott. Deletions in Binary Storage Trees. PhD thesis, Computer Science Dept., Stanford University, 1975.Google Scholar
  6. 6.
    D. E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, Reading, Mass., 1973.Google Scholar
  7. 7.
    H. M. Mahmoud. Evolution of Random Search Trees. Wiley Interscience, 1992.Google Scholar
  8. 8.
    C. Martínez and X. Messeguer. Deletion algorithms for binary search trees. Technical Report LSI-90-39, LSI-UPC, 1990.Google Scholar
  9. 9.
    W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Comm. ACM, 33(6):668–676, 1990.Google Scholar
  10. 10.
    P. Raghavan and R. Motwani. Randomized Algorithms. Cambridge University Press, 1995.Google Scholar
  11. 11.
    R. Sedgewick and P. Flajolet. An Introduction to the Analysis of Algorithms. Addison-Wesley, 1996.Google Scholar
  12. 12.
    C. J. Stephenson. A method for constructing binary search trees by making insertions at the root. Technical Report RC 6298, IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1976.Google Scholar
  13. 13.
    J. Vitter and P. Flajolet. Average-case analysis of algorithms and data structures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 9. North-Holland, 1990.Google Scholar
  14. 14.
    J. Vuillemin. A unifying look at data structures. Comm. ACM, 23(4):229–239, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Salvador Roura
    • 1
  • Conrado Martínez
    • 1
  1. 1.Departament de Llenguatges i Sistemes InformáticsUniversitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations