Generating Binary Trees by Transpositions


Let T(n) denote the set of all bitstrings with n 1's and n 0's that satisfy the property that in every preex the number of 0's does not exceed the number of 1's. This is a well known representation of binary trees. We consider algorithms for generating the elements of T(n) that satisfy one of the following constraints: (a) successive bitstrings diier by the… (More)
DOI: 10.1007/3-540-19487-8_22


7 Figures and Tables

Cite this paper

@inproceedings{Proskurowski1988GeneratingBT, title={Generating Binary Trees by Transpositions}, author={Andrzej Proskurowski and Frank Ruskey}, booktitle={SWAT}, year={1988} }