Generating t-ary trees in A-order (Q1104107)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generating t-ary trees in A-order |
scientific article |
Statements
Generating t-ary trees in A-order (English)
0 references
1988
0 references
Two `natural' orders have been defined on the set of t-ary trees. \textit{S. Zaks} [Theor. Comput. Sci. 10, 63-82 (1980; Zbl 0422.05026)] referred to these orders as A-order and B-order. Many algorithms have been developed for generating binary and t-ary trees in B-order. Here we develop an algorithm for generating all t-ary trees with n nodes in (reverse) A- order, as well as ranking and unranking algorithms. The generation algorithm produces each tree in constant average time. The analysis of the generation algorithm makes use of an interesting bijection on the set of t-ary trees. The ranking algorithm runs in O(t n) time and the unranking algorithm in O(t n lg n) time.
0 references
combinatorial generation
0 references
t-ary trees
0 references
A-order
0 references
bijection
0 references
ranking
0 references