Fast and read-only algorithms for traversing trees without an auxiliary stack
From MaRDI portal
Publication:2552381
DOI10.1016/0020-0190(72)90048-8zbMath0236.68011OpenAlexW1969294684MaRDI QIDQ2552381
Publication date: 1972
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(72)90048-8
Related Items (5)
Efficient pebbling for list traversal synopses with application to program rollback ⋮ A study of binary tree traversal algorithms and a tag-free threaded representation ⋮ A bounded-space tree traversal algorithm ⋮ On the differential properties of the support function of the∈-subdifferential of a convex function ⋮ Loop-free algorithms for traversing binary trees
Cites Work
This page was built for publication: Fast and read-only algorithms for traversing trees without an auxiliary stack
