A note on the nonrecursive traversal of binary trees
From MaRDI portal
Publication:4139674
DOI10.1093/COMJNL/20.4.350zbMath0364.68039OpenAlexW2061505799MaRDI QIDQ4139674
Publication date: 1977
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/20.4.350
Related Items (3)
The Schorr-Waite marking algorithm revisited ⋮ 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: A note on the nonrecursive traversal of binary trees