In Progress

Haskell generate all ternary trees


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!

Skills: Haskell, Mathematics, Software Development

See more: haskell data, haskell binary tree example, haskell build tree from list, haskell binary search tree, haskell binary tree operations, learn you a haskell zipper, haskell zippers, deriving haskell

About the Employer:
( 63 reviews ) Targu Mures, Romania

Project ID: #16274855

Awarded to:


Hi! I'm a Computer Engineer. I have been working with Haskell for 3 years. I would like to help you with this project. Can you give me an example of the ternary trees with depth 2 ? Because I am calculating the t More

$20 USD in 1 day
(0 Reviews)

2 freelancers are bidding on average $38 for this job

$55 USD in 1 day
(1 Review)