Write a Haskell function that generates all binary trees with empty leaves of size n

Completed Posted 7 years ago Paid on delivery
Completed Paid on delivery

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.

Haskell Programming

Project ID: #12007838

About the project

3 proposals Remote project Active 7 years ago

Awarded to:

user318

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.

$20 USD in 2 days
(2 Reviews)
1.9

3 freelancers are bidding on average $28 for this job

ahmsak

Hello Sir, I am a computer science tutor, I teach (among others) Haskell, Functional Programming and Algorithms. I have done many projects like this, and I'm one of the top Haskell developers, and you can check for r More

$40 USD in 1 day
(47 Reviews)
5.9
jaescalante02

I'm computer scientist from Venezuela. I took a advanced functional programming course in Haskell.

$23 USD in 1 day
(0 Reviews)
0.0