Nonrecursive traversals of trees
From MaRDI portal
Publication:4061958
DOI10.1093/comjnl/18.3.227zbMath0305.68032MaRDI QIDQ4061958
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
68W30: Symbolic computation and algebraic computation
68N01: General topics in the theory of software
68W99: Algorithms in computer science
Related Items
Hierarchical and modularly-minimal vertex colorings, Loop-free algorithms for traversing binary trees, A taxonomy of binary tree traversals, A study of binary tree traversal algorithms and a tag-free threaded representation