论文信息 - Permutation Representation of k-Ary Trees

Permutation Representation of k-Ary Trees

Abstract In this paper, we study the permutation representation of k-ary trees. First, we extend the notion of traversals, from binary trees to k-ary trees. A pair of k-ary tree traversals can be used to assign a permutation of the integers 1,2,… to each k-ary tree T. A pair of traversals is a valid k-ary tree Representation Scheme (k-RS) if it does not assign the same permutation to two distinct k-ary trees. We characterize such pairs of traversals. We also characterize those k-RS which assign permutations that have their lexicographic order being consistent with some well-known ‘natural’ order defined on the trees they represent.

C. L. Liu | Prakash V. Ramanan | C. Liu

[1] Anthony E. Trojanowski. Ranking and Listing Algorithms for k-ary Trees , 1978, SIAM J. Comput..

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

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

[4] Prakash V. Ramanan. Topics in Combinatorial Algorithms , 1984 .

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

[6] Chung Laung Liu. Generation of K-ARY Trees, , 1980 .

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

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

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