A loopless algorithm for generating binary tree sequences. van Baronaigien, D. Information Processing Letters, 39(4):189--194, August, 1991.
A loopless algorithm for generating binary tree sequences [link]Paper  doi  abstract   bibtex   
A loopless generation algorithm is an algorithm where the amount of computation to go from one object to the next is 0(1). As with most of the generation algorithms, the algorithm presented in this paper generates an integer sequence representation of the binary trees, but none of the previously published algorithms have been loopless. A loopless algorithm for generating all binary trees with n nodes is presented here. We also discuss ranking and unranking.
@article{ VanBaronaigien1991,
  abstract = {A loopless generation algorithm is an algorithm where the amount of computation to go from one object to the next is 0(1). As with most of the generation algorithms, the algorithm presented in this paper generates an integer sequence representation of the binary trees, but none of the previously published algorithms have been loopless. A loopless algorithm for generating all binary trees with n nodes is presented here. We also discuss ranking and unranking.},
  author = {van Baronaigien, D.Roelants},
  doi = {10.1016/0020-0190(91)90178-K},
  file = {:Users/KunihiroWASA/Dropbox/paper/1991/van Baronaigien, A loopless algorithm for generating binary tree sequences, 1991.pdf:pdf},
  issn = {00200190},
  journal = {Information Processing Letters},
  keywords = {Combinatorial problems,binary tree,binary tree sequence,designs of algorithms,loopless algorithm},
  month = {August},
  number = {4},
  pages = {189--194},
  title = {{A loopless algorithm for generating binary tree sequences}},
  url = {http://www.sciencedirect.com/science/article/pii/002001909190178K http://linkinghub.elsevier.com/retrieve/pii/002001909190178K},
  volume = {39},
  year = {1991}
}

Downloads: 0