Haskell programming small assignment

Closed Posted 7 years ago Paid on delivery
Closed 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.

Haskell

Project ID: #12965372

About the project

6 proposals Remote project Active 7 years ago

6 freelancers are bidding on average $62 for this job

ahmsak

Hello Sir, I am a computer science tutor, I teach (among others) Haskell, Scheme, LISP, Prolog and Algorithms. I have done many projects like this, and I'm one of the top Haskell developers, and you can check by cli More

$90 USD in 1 day
(91 Reviews)
6.6
mathworker

Hello. I work in area of applied mathematics. Your task is interesting for me and I can handle it. Write me for next discussion. Regards.

$60 USD in 3 days
(2 Reviews)
3.4
rekreacija

hello, place your confidence in my Haskell / BST knowledge and experience. your requirements are easy to follow. let's discuss a solution. greets, srdjan

$50 USD in 3 days
(3 Reviews)
2.8
iitmshanker

Hi, I think I have put the proposal on same project before. Please check it out and let me know if you are interested. thanks

$100 USD in 2 days
(1 Review)
1.8
denormal

Hi! Haskell is a bit of a passion for me. One clarification: are we talking about *complete* binary trees (0 or 2 children)? Then I believe that the answer is that the number of internal nodes is equal to the number More

$55 USD in 5 days
(0 Reviews)
0.0
coder115

Hey Sir, i'm a computer Science student and i have done several projects like this in past. you can have a look at my work if you want to. Kindly give me one chance and i assure you that you'll feel proud about your de More

$18 USD in 1 day
(0 Reviews)
0.0