On generating [formula omitted]-ary trees in computer representation

Abstract

Many algorithms have been developed to generate sequences for trees, and a few are to generate trees themselves, i.e., in computer representation. Two new algorithms are presented in this paper to generate k-ary trees in computer representation. One is recursive with constant average time per tree and the other is loopless (non-recursive) with constant time per tree. Both of them are simple and able to be understood easily.