Generating k-ary trees with dynamic programming approach

We present a dynamic programming Algorithm for listing k-ary trees. This Algorithm gives all Z-Sequences equivalent to k-ary trees with nnodes in B-Order lexicographically. The idea is generating trees with nnodes by trees with n-۱nodes based on two increment and concatenation operations. Also, we prove that each sequence generates in time ۰.

کلیدواژه ها:

k-ary tree ، Z-Sequence ، B-Order ، Dynamic programming ، Algorithm.