P384: Enumeration of all $k$-ary trees in lexicographically

P384: Enumeration of all $k$-ary trees in lexicographically

Input:

An integer $n$.

Output:

All $k$-ary trees with $n$ internal vertices in lexicographically

Complexity:

$O(1- (k-1)^{k-1}/k^k)^{-1}$ time per solution. This limit is $4/3$ for the binary case.

Comment:

Reference:

[Zaks1980] (Bibtex)