论文信息 - Generation of t-ary trees with Ballot-sequences*

Generation of t-ary trees with Ballot-sequences*

We define Ballot-sequences for t-ary trees based on the ideas of Ballot-sequences of binary trees presented by Rotem. Later an efficient algorithm for the generation of t-ary trees with Ballot-sequences in B-order is presented. The algorithm generates each sequence in constant average time O(1), and the sequences are generated in lexicographical order. The ranking and unranking algorithms with O(tn) time complexity are also described.

Abbas Nowzari-Dalini | Haydeh Ahrabian | A. Nowzari-Dalini | H. Ahrabian

[1] Doron Rotem,et al. Generation of Binary Trees from Ballot Sequences , 1978, JACM.

[2] Abbas Nowzari-Dalini,et al. On the generation of binary trees from (0-1) codes , 1998, Int. J. Comput. Math..

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

[4] James F. Korsh,et al. Loopless Generation of Gray Codes for k-Ary Trees , 1999, Inf. Process. Lett..

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

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

[7] Andrzej Proskurowski. On the Generation of Binary Trees , 1980, JACM.

[8] Jean Marcel Pallo,et al. Generating trees with n nodes and m leaves , 1987 .

[9] Donald E. Knuth,et al. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[10] Frank Ruskey. Generating t-ary Trees Lexicographically , 1978, SIAM J. Comput..

[11] Doron Rotem,et al. On a Correspondence Between Binary Trees and a Certain Type of Permutation , 1975, Inf. Process. Lett..

[12] Changjie Tang,et al. Efficient loopless generation of Gray codes for k-ary trees , 2000, Inf. Process. Lett..

[13] A. Nowzari-Dalini,et al. ON THE GENERATION OF P-SEQUENCES , 2003 .

[14] Vincent Vajnovszki,et al. On the Loopless Generation of Binary Tree Sequences , 1998, Inf. Process. Lett..