Enumeration of binary trees (Q1332756): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)00083-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013124115 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585020 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counting and randomly generating binary trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A loopless algorithm for generating binary tree sequences / rank | |||
Normal rank | |||
Latest revision as of 16:37, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumeration of binary trees |
scientific article |
Statements
Enumeration of binary trees (English)
0 references
13 October 1994
0 references
The authors present a procedure for listing binary trees of order \(n\) based on ternary sequences.
0 references
enumeration
0 references
binary trees
0 references
