Hi,
I just need a code that generates all ternary trees of depth n in Haskell.
A generated tree should be output in one line on console, such as the following example (or anything else that is obvious):
R-101 001 001-110 000 111 000 000 011 000 000 001
Remember, I want ALL generrated trees, not just one random tree
The above example, if I output it in multiple lines would probably make more sense:
R
101 001 001
110 000 111 000 000 011 000 000 001
Each "1" represents a node, while "0" represents no node. Notice that the root is always R, a single node. The above example is a simple ternary tree. from the next depth below the node, we always have N bits of 0 or 1, because it's all the possibilities.
I don't need the formula to count it, because the formula is obvious and I have it. I just need the one-line string outputs for the ternary trees of depth n.
This is simple, just a long description, but maximum 20-30 lines of code.
Do not bid over budget, you will be ignored!
Hello Sir,
I am a computer science tutor, I teach (among others) Haskell, Prolog and Algorithms.
I have done many projects like this, and I'm one of the top Haskell developers, and you can check by clicking on my profile picture.
Please contact me for more details when possible.
I look forward to work for you, Sir.
Best Regards.