Loop-free algorithms for traversing binary trees

DOI10.1007/BF01934513zbMath0528.68043MaRDI QIDQ786538

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)

Related Items (1)

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

Cites Work

• Traversing binary trees simply and cheaply
• Fast and read-only algorithms for traversing trees without an auxiliary stack
• Another representation of binary tree traversal
• Symbol manipulation by threaded lists
• Analysis of algorithms on threaded trees
• Generalized non-recursive traversal of binary trees
• Nonrecursive traversals of trees
• A note on the nonrecursive traversal of binary trees
• An efficient machine-independent procedure for garbage collection in various list structures
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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