On the listing and random generation of hybrid binary trees

References

• Bonnin , A. and Pallo , J. M. 1983 . A-Transformation dans les arbres n-aires . Discrete Mathematics , 45 : 153 – 163 .
   Google Scholar
• Er , M. C. 1988 . Ranking and unranking of non-regular trees . Journal of Information and Optimization Sciences , 9 : 57 – 64 .
   Google Scholar
• Gutjahr , W. 1987 . Enumeration of program structures as trees with commutative or associative nodes . Journal of Combinatorics, Information and System Sciences , 12 : 13 – 24 .
   Google Scholar
• Knott , G. D. 1977 . A numbering system for binary trees . Comm. ACM , 20 : 113 – 115 .
   Web of Science ®Google Scholar
• Knuth , D. E. 1968 . The Art of Computer Programming , Reading, Massachusetts : Addison-Wesley .
   Google Scholar
• Lee , C. C. , Lee , D. T. and Wong , C. K. 1986 . Generating binary trees of bounded height . Acta Informatica , 23 : 529 – 544 .
   Web of Science ®Google Scholar
• Li , L. 1986 . Ranking and unranking of AVL trees . SIAM J. Computing , 15 : 1025 – 1035 .
   Google Scholar
• Martin , H. W. and Orr , B. J. 1989 . Proceedings ACM 17th Annual Computer Science Conference . A random binary tree generator . 1989 , Louisville. ACM Press .
   Google Scholar
• Pallo , J. M. 1986 . Enumerating, ranking and unranking binary trees . The Computer Journal , 29 : 171 – 175 .
   Web of Science ®Google Scholar
• Pallo , J. M. 1987 . Generating trees with n nodes and m leaves . Int. Journal of Computer Mathematics , 21 : 133 – 144 .
   Web of Science ®Google Scholar
• Pallo , J. M. 1989 . Lexicographic generation of binary unordered trees . Pattern Recognition Letters , 10 : 217 – 221 .
   Google Scholar
• Pallo , J. M. 1990 . A simple algorithm for generating neuronal dendritic trees . Computer Methods and Programs in Biomedicine , 33 : 165 – 169 .
   PubMed Web of Science ®Google Scholar
• Pallo , J. M. and Racca , R. 1985 . A note on generating binary trees in A-order and B-order . Int. Journal of Computer Mathematics , 18 : 27 – 39 .
   Web of Science ®Google Scholar
• Ruskey , F. and Hu , T. C. 1977 . Generating binary trees lexicographically . SIAM J. Computing , 6 : 745 – 758 .
   Web of Science ®Google Scholar
• Ruskey , F. and Proskurowski , A. 1990 . Generating binary trees by transpositions . Journal of Algorithms , 11 : 68 – 84 .
   Google Scholar
• Sloane , N. J. A. 1973 . A Handbook of Integer Sequences , Academic Press .
   Google Scholar
• Sprugnoli , R. 1992 . The generation of binary trees as a numerical problem . JACM , 39 : 317 – 327 .
   Google Scholar
• Trojanowski , A. E. 1978 . Ranking and listing algorithms for k-ary trees . SIAM J. Computing , 7 : 492 – 509 .
   Web of Science ®Google Scholar
• Wilf , H. S. 1977 . A unified setting for sequencing, ranking and selection algorithms for combinatorial objects . Advances in Mathematics , 24 : 281 – 291 .
   Web of Science ®Google Scholar
• Williamson S. G. On the ordering, ranking and random generation of basic combinatorial sets Combinatoire et représentation du groupe symetrique Strasbourg 1976 579 309 339 Lecture Notes in Mathematics
   Google Scholar
• Zaks , S. 1980 . Lexicographic generation of ordered trees . Theoretical Computer Science , 10 : 63 – 82 .
   Web of Science ®Google Scholar