P357: Enumeration of all free trees with $n$ vertices

P357: Enumeration of all free trees with $n$ vertices

Input:

An integer $n$.

Output:

All free trees with $n$ vertices.

Complexity:

$O(1)$ time per solution.

Comment:

Reference:

[Wright1986] (Bibtex)