Write a Haskell function that generates all binary trees with empty leaves of size n
$10-30 USD
Pagado a la entrega
Write a Haskell function that generates all binary trees with empty leaves of size n.
Then, given a binary tree, write a function that counts the number of leaves and another function that the number of internal nodes.
What do you observe about the two results? Write a short proof by induction as a comment added to your program stating that your observation applies to binary trees of any size.
The uploaded file is a similar concept of what the function should be like.
Nº del proyecto: #12007838
Sobre el proyecto
Adjudicado a:
Hi. I can help you with this task. I have experience of writing not too complex programs in Haskell - different algorithms, data structures examples, etc. Already helped one guy with Haskell here some time ago.
3 freelancers están ofertando un promedio de $28 por este trabajo
I'm computer scientist from Venezuela. I took a advanced functional programming course in Haskell.
