Simple algorithms for traversing a tree without an auxiliary stack
References (3)
Inform. Proc. Lett.
(1973)
There are more references available in the full text version of this article.
Cited by (7)
Morris' tree traversal algorithm reconsidered
1988, Science of Computer ProgrammingRecent developments in the theory of data structures
1978, Computer LanguagesPhase change of limit laws in the quicksort recurrence under varying toll functions
2002, SIAM Journal on ComputingAdvanced data structures
2008, Advanced Data StructuresA Study of Binary Tree Traversal Algorithms and a Tag-free Threaded Representation
1986, International Journal of Computer Mathematics
Copyright © 1974 Published by Elsevier B.V.