Skip to main content
SpringerLink
Log in

A note on traversal algorithms for triply linked binary trees

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

Abstract

Concise well-structured non-recursive algorithms for traversing triply linked binary trees in the three principal orders are presented and shown to be closely related.

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. W. A. Burkhard,Nonrecursive traversals of trees, Computer J. 18 (1975), 227–230.

    Google Scholar 

  2. T. I. Fenner and G. Loizou,A binary tree representation and related algorithms for generating integer partitions, Computer J. 23 (1980), 332–337.

    Google Scholar 

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

    Google Scholar 

  4. J. M. Morris,Traversing binary trees simply and cheaply, Information Processing Lett. 9 (1979), 197–200.

    Google Scholar 

  5. A. J. Perlis and C. Thornton,Symbol manipulation by threaded lists, Comm. ACM 3 (1960), 195–204.

    Google Scholar 

  6. J. L. Pfaltz,Computer Data Structures, McGraw-Hill, New York, 1977.

    Google Scholar 

  7. H. Schorr and W. M. Waite,An efficient machine-independent procedure for garbage collection in various list structures, Comm. ACM 10 (1967), 501–506.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science Birkbeck College, University of London, Malet Street, WC1E 7HX, London, England

    T. I. Fenner & G. Loizou

Authors
  1. T. I. Fenner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Loizou
    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

Fenner, T.I., Loizou, G. A note on traversal algorithms for triply linked binary trees. BIT 21, 153–156 (1981). https://doi.org/10.1007/BF01933159

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation