Loop-free algorithms for traversing binary trees

DOI10.1007/BF01934513MaRDI QIDQ786538zbMATH OpenFDO

Authors N. E. Zubov

Publication date 1984

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

survey24, 33-44 (1984)loop-free traversal algorithmstraversal orderstraversing binary trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3752177 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 3594611 (Why is no real title available?)
• A note on the nonrecursive traversal of binary trees
• An efficient machine-independent procedure for garbage collection in various list structures
• Analysis of algorithms on threaded trees
• Another representation of binary tree traversal
• Fast and read-only algorithms for traversing trees without an auxiliary stack
• Generalized non-recursive traversal of binary trees
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Nonrecursive traversals of trees
• Symbol manipulation by threaded lists
• Traversing binary trees simply and cheaply

Cited in

(1)

• A study of binary tree traversal algorithms and a tag-free threaded representation

This page was built for publication: Loop-free algorithms for traversing binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786538)