Counting labels in binary trees (Q583877): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Expected Performance of Traversal Algorithms in Binary Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On deletion in threaded binary trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A numbering system for binary trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the allocation of binary trees to secondary storage / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The generation of binary trees as a numerical problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ranking and Listing Algorithms for <i>k</i>-Ary Trees / rank | |||
Normal rank |
Revision as of 12:08, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Counting labels in binary trees |
scientific article |
Statements
Counting labels in binary trees (English)
0 references
1990
0 references
permutation trees
0 references
tree labelling
0 references
uniform trees
0 references