A bounded-space tree traversal algorithm
From MaRDI portal
Recommendations
- Morris' tree traversal algorithm reconsidered
- A study of binary tree traversal algorithms and a tag-free threaded representation
- Construction of a tree from its traversals in optimal time and space
- A note on the reconstruction of a binary tree from its traversals
- Constructing a binary tree efficiently from its traversals
Cites work
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- An efficient machine-independent procedure for garbage collection in various list structures
- An implicit data structure for searching a multikey table in logarithmic time
- An implicit data structure supporting insertion, deletion, and search in O( ^ 2\,n) time
- Average Case Analysis of Marking Algorithms
- Fast and read-only algorithms for traversing trees without an auxiliary stack
- Implicit Data Structures for the Dictionary Problem
- Symbol manipulation by threaded lists
Cited in
(7)- O(1) reversible tree navigation without cycles
- A study of binary tree traversal algorithms and a tag-free threaded representation
- scientific article; zbMATH DE number 6622715 (Why is no real title available?)
- Morris' tree traversal algorithm reconsidered
- Depth-first layout algorithm for trees.
- Efficient pebbling for list traversal synopses with application to program rollback
- scientific article; zbMATH DE number 3982557 (Why is no real title available?)
This page was built for publication: A bounded-space tree traversal algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689629)
