P363: Enumeration of all binary trees with $n$ vertices

P363: Enumeration of all binary trees with $n$ vertices

Input:

An integer $n$.

Output:

All binary trees with $n$ vertices.

Complexity:

$O(n)$ time per solution.

Comment:

Reference:

[Proskurowski1985] (Bibtex)