Listing and counting subtrees of equal size of a binary tree
- 8 November 1983
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 17 (4) , 225-229
- https://doi.org/10.1016/0020-0190(83)90046-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The average height of binary trees and other simple treesJournal of Computer and System Sciences, 1982
- Listing and Counting Subtrees of a TreeSIAM Journal on Computing, 1981
- Lexicographic generation of ordered treesTheoretical Computer Science, 1980
- On the Generation of Binary TreesJournal of the ACM, 1980
- A Note on Enumerating Binary TreesJournal of the ACM, 1980
- Generating Trees and Other Combinatorial Objects LexicographicallySIAM Journal on Computing, 1979
- Ranking and Listing Algorithms for k-Ary TreesSIAM 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