Fast and read-only algorithms for traversing trees without an auxiliary stack (Q2552381)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast and read-only algorithms for traversing trees without an auxiliary stack |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast and read-only algorithms for traversing trees without an auxiliary stack |
scientific article |
Statements
Fast and read-only algorithms for traversing trees without an auxiliary stack (English)
0 references
1972
0 references
