A bounded-space tree traversal algorithm
From MaRDI portal
Publication:689629
DOI10.1016/0020-0190(93)90035-8zbMATH Open0779.68020OpenAlexW1964434857MaRDI QIDQ689629FDOQ689629
Authors: Daniel S. Hirschberg, Steven S. Seiden 
Publication date: 15 November 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90035-8
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
- Title not available (Why is that?)
- An efficient machine-independent procedure for garbage collection in various list structures
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
- Implicit Data Structures for the Dictionary Problem
- An implicit data structure for searching a multikey table in logarithmic time
- Fast and read-only algorithms for traversing trees without an auxiliary stack
- Symbol manipulation by threaded lists
- Average Case Analysis of Marking Algorithms
Cited In (7)
- O(1) reversible tree navigation without cycles
- A study of binary tree traversal algorithms and a tag-free threaded representation
- Title not available (Why is that?)
- Morris' tree traversal algorithm reconsidered
- Depth-first layout algorithm for trees.
- Efficient pebbling for list traversal synopses with application to program rollback
- Title not available (Why is that?)
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)
