Generating trees with n nodes and m leaves

References

• Bonnin , A. Pallo , J.M. 1984 . Sur la génération des arbres binaires par les B-suites . Discrete Maths , 51 : 111 – 117 .
   Google Scholar
• Dershowitz , N. and Zaks , S. 1980 . Enumerations of ordered trees . Discrete Maths , 31 : 9 – 28 .
   Google Scholar
• Pallo , J.M. 1986 . Enumerating, ranking and unranking binary trees . The Computer Journal , 29 ( 2 ) : 171 – 175 .
   Web of Science ®Google Scholar
• Pallo , J. and Racca , R. 1985 . A note on generating binary trees in A-order and B-order . Intern. J. Computer Math , 18 ( 1 ) : 27 – 39 .
   Web of Science ®Google Scholar
• Prodinger , H. 1983 . A correspondence between ordered trees and noncrossing partitions . Discrete Maths , 46 ( 1 ) : 205 – 206 .
   Google Scholar
• Ruskey , F. 1978 . Generating t-ary trees lexicographically . SIAM J. Comput , 7 ( 4 ) : 424 – 439 .
   Web of Science ®Google Scholar
• Trojanowski , A.E. 1978 . Ranking and listing algorithms for k-ary trees . SIAM J. Comput , 7 ( 4 ) : 492 – 509 .
   Web of Science ®Google Scholar
• Zaks , S. 1982 . Generation and ranking of k-ary trees . Information Processing Letters , 14 ( 1 ) : 44 – 48 .
   Web of Science ®Google Scholar
• Zaks , S. and Richards , D. 1979 . Generating trees and other combinatorial objects lexicographically . SIAM J. Comput , 8 ( 1 ) : 73 – 81 .
   Web of Science ®Google Scholar