I just need a code that generates all ternary trees of depth N in Haskell.
Each generated tree should be output on one line, and you can represent it in any way that is readable. For example, depth 2 has 7 trees, depth 3 has around 720-730 trees.
I think this can be done in 1-2 hours maximum
Waiting for your offers!