Lexicographic Listing and Ranking of t-Ary Trees

@article{Er1987LexicographicLA,
  title={Lexicographic Listing and Ranking of t-Ary Trees},
  author={M. C. Er},
  journal={Comput. J.},
  year={1987},
  volume={30},
  pages={569-572}
}
This paper presents three simple and efficient algorithms for generating, ranking and unranking t-ary trees in a lexicographic order. The simplest idea of encoding a t-ary tree with n nodes as a bit-string of length t*n is exploited to its full advantages. It is proved that the lexicographic order in the set of t-ary trees with n nodes is preserved in the set of bit-strings of length t*n, using the above encoding scheme. Thus by generating all bit-strings in the lexicographic order, a simple… CONTINUE READING