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

DOI10.1080/00207168608803542zbMath0655.68084OpenAlexW2084361809MaRDI QIDQ3802643

No author found.

Publication date: 1986

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168608803542

zbMATH Keywords

binary tree traversaltag-free

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Optimal binary search trees

Cites Work

• Unnamed Item
• Loop-free algorithms for traversing binary trees
• Traversing binary trees simply and cheaply
• The Schorr-Waite marking algorithm revisited
• Fast and read-only algorithms for traversing trees without an auxiliary stack
• The Expected Performance of Traversal Algorithms in Binary Trees
• Analysis of algorithms on threaded trees
• Computer programming as an art
• Nonrecursive traversals of trees
• A note on the nonrecursive traversal of binary trees

This page was built for publication: A study of binary tree traversal algorithms and a tag-free threaded representation