This paper presents new algorithms for generating all n-node t-ary trees in linked representation which take constant average time per tree. They use fewer memory references and are considerably faster than previous such algorithms.
['James F. Korsh']
Fast Generation of t-ary Trees