Fast and read-only algorithms for traversing trees without an auxiliary stack (Q2552381)

From MaRDI portal
Revision as of 21:58, 5 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    1972
    0 references

    Identifiers