P351: Enumeration of all binary trees with $n$ leaves

P351: Enumeration of all binary trees with $n$ leaves

Input:

An integer $n$.

Output:

All binary trees with $n$ leaves.

Complexity:

$O(1)$ amortized time per solution.

Comment:

A strong Gray code can be listed in constant average time per solution.

Reference:

[Ruskey1990] (Bibtex)