Scanning list structures without stacks or tag bits
References (4)
Inf. Proc. Letters
(1972)Fundamental Algorithms
(1968)
There are more references available in the full text version of this article.
Cited by (26)
Verifying pointer programs using graph grammars
2015, Science of Computer ProgrammingCitation Excerpt :Lindstrom tree scan. The Lindstrom algorithm [13] is a variant of the Deutsch-Schorr–Waite tree traversal algorithm (DSW) [14]. This algorithm traverses a tree or DAG without requiring an (explicit or implicit) stack.
A bounded-space tree traversal algorithm
1993, Information Processing LettersMorris' tree traversal algorithm reconsidered
1988, Science of Computer ProgrammingA tagless marking that is linear over subtrees
1988, Information Processing LettersTwo tagless variations on the Deutsch-Schorr-waite algorithm
1986, Information Processing LettersRecent developments in the theory of data structures
1978, Computer Languages
Copyright © 1973 Published by Elsevier B.V.