A note on generating binary trees inA-order andB-order
- 1 January 1985
- journal article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 18 (1) , 27-39
- https://doi.org/10.1080/00207168508803477
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Sur la generation des arbres binaires par les B-suitesDiscrete Mathematics, 1984
- Ranking and unranking of B-treesJournal of Algorithms, 1983
- A Note on Generating Well-formed Parenthesis Strings LexicographicallyThe Computer Journal, 1983
- Constant Time Generation of Rooted TreesSIAM Journal on Computing, 1980
- Enumerations of ordered treesDiscrete Mathematics, 1980
- On the Generation of Binary TreesJournal of the ACM, 1980
- 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
- On a correspondence between binary trees and a certain type of permutationInformation Processing Letters, 1975