A bounded-space tree traversal algorithm

DOI10.1016/0020-0190(93)90035-8zbMath0779.68020OpenAlexW1964434857MaRDI QIDQ689629

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

zbMATH Keywords

linear timecyclic listtree traversal

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (1)

Efficient pebbling for list traversal synopses with application to program rollback

Cites Work

• Unnamed Item
• An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
• 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
• Implicit Data Structures for the Dictionary Problem
• An efficient machine-independent procedure for garbage collection in various list structures

This page was built for publication: A bounded-space tree traversal algorithm