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

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

Input:

An integer $n$.

Output:

All binary trees with $n$ vertices.

Complexity:

$O(1)$ time per solution.

Comment:

Reference:

[Lucas1987] (Bibtex)