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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(89)90048-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058211217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on plane trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of registers required for evaluating arithmetic expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5333061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average number of registers needed to evaluate a binary tree optimally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of deepest nodes in ordered trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating <i>t</i>-Ary Trees Lexicographically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two short proofs of Kemp's identity for rooted plane trees / rank
 
Normal rank

Latest revision as of 10:09, 20 June 2024

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
    0 references