论文信息 - A Loopless Algorithm for Generating Binary Tree Sequences

A Loopless Algorithm for Generating Binary Tree Sequences

Abstract A loopless generation algorithm is an algorithm where the amount of computation to go from one object to the next is 0(1). As with most of the generation algorithms, the algorithm presented in this paper generates an integer sequence representation of the binary trees, but none of the previously published algorithms have been loopless. A loopless algorithm for generating all binary trees with n nodes is presented here. We also discuss ranking and unranking.

Dominique Roelants van Baronaigien

[1] Frank Ruskey,et al. Binary Tree Gray Codes , 1985, J. Algorithms.

[2] Erkki Mäkinen,et al. Left distance binary tree representations , 1987, BIT.

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

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

[5] Gideon Ehrlich,et al. Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations , 1973, JACM.

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

[7] David Zerling,et al. Generating binary trees using rotations , 1985, JACM.

[8] Frank Ruskey,et al. Generating Binary Trees by Transpositions , 1988, J. Algorithms.

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

[10] Trevor I. Fenner,et al. A Binary Tree Representation and Related Algorithms for Generating Partitions , 1980, Comput. J..

[11] Joan M. Lucas. The Rotation Graph of Binary Trees is Hamiltonian , 1987, J. Algorithms.

[12] Edward M. Reingold,et al. Efficient generation of the binary reflected gray code and its applications , 1976, CACM.