References
- Ahrabian , H. and Nowzari-Dalini , A. (1998) . On the generation of binary trees, from (0-1) codes . Intern. J. Comput. Math. , 69 : 243 – 251 .
- Gupta , D. K. (1991) . On the generation of P-sequences . Intern. J. Comput. Math. , 38 : 31 – 35 .
- Knuth D. E. (1973) The Art of Computer Programming: Fundamental Algorithms Vol. I 2nd ed. Addison-Wesley Reading MA
- Korsh , J. F. and LaFollette , P. (1999) . Loopless generation of Gray codes for k-ary trees . Inform. Process. Lett. , 70 : 7 – 11 .
- Pallo , J. (1987) . Generating trees with n nodes and m leaves . Intern. J. Comput. Math. , 21 : 133 – 144 .
- Pallo , J. and Racca , R. (1985) . A note on generating binary tree in A-order and B-order . Intern. J. Comput. Math. , 18 : 27 – 39 .
- Rotem , D. (1975) . On a correspondence between binary tree and certain type of permutation . Inform. Process. Lett. , 4 : 58 – 61 .
- Rotem , D. and Varol , Y. L. (1978) . Generation of binary trees from Ballot-sequences . J. ACM , 25 : 396 – 404 .
- Ruskey , F. (1978) . Generating t-ary trees lexicographically . SIAM. J. Comput. , 7 : 424 – 439 .
- Vajnovszki , V. (1998) . On the loopless generation of binary tree sequences . Inform. Process. Lett. , 68 : 113 – 117 .
- Xiang , L. , Ushijima , K. and Tang , C. (2000) . Efficient loopless generation of Gray codes for k-ary trees . Inform. Process. Lett. , 76 : 169 – 174 .
- Zaks , S. (1980) . Lexicographic generation of ordered tree . Theoret. Comput. Sci. , 10 : 63 – 82 .