A one-to-one correspondence between two classes of ordered trees (Q1123634)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4110141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A one-to-one correspondence between two classes of ordered trees |
scientific article; zbMATH DE number 4110141 |
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
0.733705997467041
0 references
0.7128850221633911
0 references
