Nonrecursive traversals of trees

DOI10.1093/comjnl/18.3.227zbMath0305.68032OpenAlexW2045594573MaRDI QIDQ4061958

Walter A. Burkhard

Publication date: 1975

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/18.3.227

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (4)

A taxonomy of binary tree traversals ⋮ Hierarchical and modularly-minimal vertex colorings ⋮ A study of binary tree traversal algorithms and a tag-free threaded representation ⋮ Loop-free algorithms for traversing binary trees

This page was built for publication: Nonrecursive traversals of trees