Skip to main content
SpringerLink
Log in

A trivial algorithm whose analysis is not: A continuation

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

This work analyzes insertion/deletion cycles in binary search trees with three and four elements, extending previous results of Jonassen and Knuth. We compare the symmetric and asymmetric deletion algorithms, and the results show that the symmetric algorithm works better, for trees with four elements, in accordance with many empirical measures.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Jonassen, A. T. and Knuth, D. E.A trivial algorithm whose analysis isn't, Journal of Computer and System Science (1978), Vol. 16, pp. 301–322.

    Article  Google Scholar 

  2. Eppinger, J. L.An empirical study of insertion and deletion in binary trees, Communications of the ACM (1983), Vol. 26, pp. 663–669.

    Article  Google Scholar 

  3. Culberson, J. C.Updating Binary Trees, M.Sc. Thesis, Report CS-84-08, Department of Computer Science, University of Waterloo, Waterloo, Canada, 1984.

    Google Scholar 

  4. Baeza-Yates, R. A.Análisis de algoritmos en Arboles de Búsqueda (Analysis of Algorithms in Search Trees, in Spanish), M.Sc. Thesis, Department of Computer Science, University of Chile, Santiago, Chile, January 1985.

    Google Scholar 

  5. Hibbard, T. N.Some combinatorial properties of certain trees with applications to searching and sorting, Journal of ACM (1962), Vol. 9, pp. 13–28.

    Article  Google Scholar 

  6. Knuth, D. E.The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, Mass., 1973.

    Google Scholar 

  7. Knott, G. D.Deletions in Binary Storage Trees, Ph.D. Thesis, Computer Science Department, Stanford University, Report STAN-CS-75-491, May 1975.

  8. Knuth, D. E.Deletions that preserve randomness, IEEE Transactions on Software Engineering (1977), Vol. 3, pp. 351–359.

    Google Scholar 

  9. Mehlhorn, K.A partial analysis of height-balanced trees under random insertions and deletions, SIAM Journal of Computing (1979), Vol. 11, pp. 748–760.

    Article  Google Scholar 

  10. Culberson, J. C.The Effect of Asymmetric Deletions on Binary Search Trees, Ph.D. Thesis, Report CS-86-15, Department of Computer Science, University of Waterloo, Waterloo, Canada, May 1986.

    Google Scholar 

  11. Geddes, K. O., Gonnet, G. H. and Char, B. W.MAPLE User's Manual, Second Edition, Report CS-82-40, Department of Computer Science, University of Waterloo, Waterloo, Canada, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Ciencias de la Computación, Facultad de Ciencias Fiśicas y Matemáticas, Universidad de Chile, Casilla 2777, Santiago, Chile

    Ricardo A. Baeza-Yates

Authors
  1. Ricardo A. Baeza-Yates
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baeza-Yates, R.A. A trivial algorithm whose analysis is not: A continuation. BIT 29, 378–394 (1989). https://doi.org/10.1007/BF02219226

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02219226

CR Categories

Additional Keywords

Search

Navigation