Skip to main content
Springer Nature Link
Log in

A simple and powerful representation of binary search trees

  • Track 4: Algorithms
  • Conference paper
  • First Online:
Computing in the 90's (Great Lakes CS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 507))

Included in the following conference series:

  • 132 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

IV. References

  1. Aho, A.V., J.E. Hopcroft and J.D. Ullman, "Data Structures and Algorithms", Addison-Wesley, 1983.

    Google Scholar 

  2. Bentley, J.I, Multidimensional Binary Search Trees Used for Associative Searching, CACM, 18, 9, 1975.

    Google Scholar 

  3. Brinck, K., The Expected Performance of Traversal Algorithms in Binary trees, Comput. J., 28, 4, 1985.

    Google Scholar 

  4. Brinck, K. and N.Y. Koo, Analysis of Algorithms on Threaded Trees, Comput. J., 24, 2, 1981.

    Google Scholar 

  5. Cheng, Y., E. Haq and S.-Q. Zheng, "Threaded Binary Search Trees Without Tags", Proc. of International Conference on Computing and Information, Toronto, 1989.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  8. Preparata, F.P. and M.I. Shamos, Computational Geometry, Springer-Verlag, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Louisiana State University, 70803-4020, Baton Rouge, LA

    Si-Qing Zheng

Authors
  1. Si-Qing Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zheng, SQ. (1991). A simple and powerful representation of binary search trees. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038492

Download citation

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

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics