A one-to-one correspondence between two classes of ordered trees (Q1123634): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:18, 31 January 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
1989
0 references
combinatorial problems
0 references
data structures
0 references
ordered trees
0 references
postorder- traversing
0 references
