Scanning list structures without stacks or tag bits

https://doi.org/10.1016/0020-0190(73)90012-4Get rights and content

First page preview

First page preview
Click to open first page preview

References (4)

  • Laurent Siklossy

    Inf. Proc. Letters

    (1972)
  • Donald E. Knuth

    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 Programming
    Citation 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 Letters
  • Morris' tree traversal algorithm reconsidered

    1988, Science of Computer Programming
  • A tagless marking that is linear over subtrees

    1988, Information Processing Letters
View all citing articles on Scopus
View full text