Advanced version of Unique Binary Search Trees

This time, we have to collect the trees instead of counting.

So just generate left and right, then make cartesian product of them.