Documentation

Computes the set of equivalence classes of trees (in the
sense that the leaves of a node are unordered)
with n = length ks leaves where the set of heights of
the leaves matches the given set of numbers.
The height is defined as the number of edges from the leaf to the root.