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

From MaRDI portal
Revision as of 15:32, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1178223)
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

    Identifiers