A Simple Algorithm for Generating Non-regular Trees in Lexicographic Order
M. C. Er · The Computer Journal · 1988
A one-to-one correspondence between a set of non-regular trees that have ni internal nodes each with ki sons, for 1≤i≤t, and (m+1) leaves and a set of feasible codewords that have ni occurrences of ki, for 1≤i≤t, and m occurrences of 0 is proved to be isotone, where [equation: see PDF] A simple and efficient algorithm for generating a set of non-regular trees in lexicographic order is presented.