Morris' tree traversal algorithm reconsidered

DOI10.1016/0167-6423(88)90063-9MaRDI QIDQ1122985zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Prabhaker Mateti, Ravi Manghirmalani

Publication date 1988

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(88)90063-9

zbMATH Keywords

binary treestree traversalMorris' algorithmstack-free algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Recommendations

• A study of binary tree traversal algorithms and a tag-free threaded representation
• A bounded-space tree traversal algorithm
• A trivial algorithm whose analysis is not: a continuation
• A taxonomy of binary tree traversals
• Parallel algorithms for tree traversals

Cited in

(6)

• A study of binary tree traversal algorithms and a tag-free threaded representation
• Trees with the mos subtrees - an algorithmic approach
• A bounded-space tree traversal algorithm
• A taxonomy of binary tree traversals
• Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm
• scientific article; zbMATH DE number 3982557 (Why is no real title available?)

This page was built for publication: Morris' tree traversal algorithm reconsidered

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