A one-to-one correspondence between two classes of ordered trees (Q1123634)

From MaRDI portal
Revision as of 18:31, 13 July 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
A one-to-one correspondence between two classes of ordered trees
scientific article

    Statements

    A one-to-one correspondence between two classes of ordered trees (English)
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial problems
    0 references
    data structures
    0 references
    ordered trees
    0 references
    postorder- traversing
    0 references