Generating binary trees of bounded height
- 1 September 1986
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 23 (5) , 529-544
- https://doi.org/10.1007/bf00288468
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Ranking and unranking of B-treesJournal of Algorithms, 1983
- Ranking and Unranking of 2-3 TreesSIAM Journal on Computing, 1982
- Constant Time Generation of Rooted TreesSIAM Journal on Computing, 1980
- On the Generation of Binary TreesJournal of the ACM, 1980
- A Note on Enumerating Binary TreesJournal of the ACM, 1980
- Ranking and Listing Algorithms for k-Ary TreesSIAM Journal on Computing, 1978
- Generating t-Ary Trees LexicographicallySIAM Journal on Computing, 1978
- Generation of Binary Trees from Ballot SequencesJournal of the ACM, 1978
- Generating Binary Trees LexicographicallySIAM Journal on Computing, 1977
- A numbering system for binary treesCommunications of the ACM, 1977