Lexicographic generation of ordered trees

AbstractWe show a one-one correspondence between all the regular binary trees with n internal nodes and certain integer sequences, an algorithm for generating these trees lexicographically, and the ranking function and the corresponding unranking procedure. We then extend the generating algorithm to k-ary trees, and analyze the amount of work done per tree. Relations to existing algorithms are discussed