A study of binary tree traversal algorithms and a tag-free threaded representation

References

• Bauer , F.L. and Wössner , H. 1982 . Algorithmic Language and Program Development , Heidelberg : Springer-Verlag .
   Google Scholar
• Brinck , K. 1985 . The expected performance of traversal algorithms in binary trees . Comput. J , 28 : 426 – 432 .
   Web of Science ®Google Scholar
• Brinck , K. and Foo , N.Y. 1981 . Analysis of algorithms on threaded trees . Comput. J , 24 : 148 – 155 .
   Web of Science ®Google Scholar
• Burkhard , W.A. 1975 . Nonrecursive traversal of trees . Comput. J , 18 : 227 – 230 .
   Google Scholar
• Dershowitz , N. 1980 . The Schorr-Waite marking algorithm revisited . Inform. Process. Lett , 11 : 141 – 143 .
   Web of Science ®Google Scholar
• Dwyer , B. 1974 . Simple algorithms for traversing a tree without an auxiliary stack . Inform. Process. Lett , 2 : 143 – 145 .
   Google Scholar
• Fenner , T.I. and Loizou , G. 1981 . A note on traversal algorithms for triply linked binary trees . BIT , 21 : 153 – 156 .
   Google Scholar
• Fenner , T.I. and Loizou , G. 1984 . Loop-free algorithms for traversing binary trees . BIT , 24 : 33 – 44 .
   Google Scholar
• Knuth , D.E. “ Fundamental Algorithms ” . In The Art of Computer Programming , Reading, Mass : Addison-Wesley .
   Google Scholar
• Lindstrom , G. 1973 . Scanning list structures without stacks or tag bits . Inform. Process. Lett , 2 : 47 – 51 .
   Google Scholar
• Lindstrom , G. 1974 . Copying list structures using bounded workspace . Comm. ACM , 17 : 198 – 202 .
   Web of Science ®Google Scholar
• Morris , J.M. 1979 . Traversing binary trees simply and cheaply . Inform. Process. Lett , 9 : 197 – 200 .
   Web of Science ®Google Scholar
• Robson , J. 1973 . An improved algorithm for traversing binary trees without auxiliary stack . Inform. Process. Lett , 2 : 12 – 14 .
   Google Scholar
• Siklóssy , L. 1972 . Fast and read-only algorithms for traversing trees without an auxiliary stack . Inform. Process. Lett , 1 : 149 – 152 .
   Google Scholar
• Soule , S. 1977 . A note on the nonrecursive traversal of binary trees . Comput. J , 20 : 350 – 352 .
   Web of Science ®Google Scholar
• Standish , T.A. 1980 . Data Structure Techniques , Reading, Mass : Addison-Wesley .
   Google Scholar
• Waite , W.M. 1977 . Letter to the Editor . Comput. J , 20 : 92 – 93 .
   Google Scholar