GENERATING k-ARY TREES IN LEXICOGRAPHIC ORDER

This paper discusses the Ll -restricted k-ary trees. We represent a k-ary tree by the level numbers of its leaves. Thus every k-ary tree with n leaves corresponds to a sequence of n positive integers. We first give the necessary and sufficient conditions for a sequence representing a k-ary tree, and then present an algorithm for generating all the Ll -restricted feasible sequences lexicographically as a list.