Generating binary trees in A-order from codewords defined on a four-letter alphabet

[1]  Elena Barcucci,et al.  Some more properties of Catalan numbers , 1992, Discret. Math..

[2]  Jörg-Rüdiger Sack,et al.  Generating Binary Trees at Random , 1992, Inf. Process. Lett..

[3]  Marvin H. Solomon,et al.  A Note on Enumerating Binary Trees , 1980, JACM.

[4]  Gary D. Knott,et al.  A numbering system for binary trees , 1977, CACM.

[5]  Renzo Sprugnoli,et al.  The generation of binary trees as a numerical problem , 1992, JACM.

[6]  Frank Ruskey,et al.  Generating Binary Trees Lexicographically , 1977, SIAM J. Comput..

[7]  Frank Ruskey,et al.  Generating t-ary Trees in A-Order , 1988, Inf. Process. Lett..

[8]  Erkki Mäkinen,et al.  A Survey on Binary Tree Codings , 1991, Comput. J..

[9]  Andrzej Ehrenfeucht,et al.  Grammatical codes of trees , 1991, Discret. Appl. Math..

[10]  Shmuel Zaks,et al.  Lexicographic Generation of Ordered Trees , 1980, Theor. Comput. Sci..

[11]  J. Pallo.  Coding Binary Trees by Words over an Alphabet with Four Letters , 1992 .

[12]  Jean Marcel Pallo,et al.  Enumerating, Ranking and Unranking Binary Trees , 1986, Comput. J..

[13]  Doron Rotem,et al.  Stack sortable permutations , 1981, Discret. Math..

[14]  Jean Marcel Pallo,et al.  A note on generating binary trees in A-order and B-order , 1985 .

[15]  M. C. Er.  Efficient Generation of k-ary Trees in Natural Order (Short Note) , 1992, Comput. J..

[16]  Erkki Mäkinen,et al.  Tree Compression and Optimization with Applications , 1990, Int. J. Found. Comput. Sci..

[17]  M. Er.  Ranking and Unranking of Non-regular Trees , 1988 .