skip to main content
article
Free Access

Increasing the clarity of binary tree traveral procedures

Published:01 June 1979Publication History
First page image

References

  1. fr1. Communications of the ACM, Vol. 11, No. 9, pp. 172-173.Google ScholarGoogle Scholar
  2. fr2. Knuth, D. E., The Art of Computer Programming (Reading, Mass.: Addison-Wesley, 1969),pp. 315-328.Google ScholarGoogle Scholar
  3. fr3. Tremblay, J. P. and P. G. Sorenson, An Introduction to Data Structures with Applications, New York: McGraw-Hill, 1976), pp. 320-326. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. fr4. Knuth, p. 316.Google ScholarGoogle Scholar
  5. fr5. Lewis, T. G., and M. Z. Smith, Applying Data Structures, (Atlanta: Houghton-Mifflin, 1976), pp.71-74. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. fr6. Page, E. S. and L. B. Wilson, Information Representation and Manipulation in a Computer, (Cambridge: Cambridge University Press, 1975), p. 113. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGCSE Bulletin
    ACM SIGCSE Bulletin  Volume 11, Issue 2
    June 1979
    50 pages
    ISSN:0097-8418
    DOI:10.1145/988923
    Issue’s Table of Contents

    Copyright © 1979 Author

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 June 1979

    Check for updates

    Qualifiers

    • article
  • Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader
About Cookies On This Site

We use cookies to ensure that we give you the best experience on our website.

Learn more

Got it!