Small haskell program

$250-750 USD

Cancelled

Posted

about 7 years ago

$250-750 USD

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.

Algorithm

Haskell

Project ID: 12965311

About the project

2 proposals

Remote project

Active 7 yrs ago

Looking to make some money?

Email address

Benefits of bidding on Freelancer

Set your budget and timeframe

Get paid for your work

Outline your proposal

It's free to sign up and bid on jobs

2 freelancers are bidding on average $511 USD for this job

@wangbeizou

Hello. How are you. I have read and understood the project. I'm an Expert in Data Structures and Algorithms. And I know well ; Hakell, Java ,C/C++, Python ,PHP. I'm interested this project. So, firstly I want to discuss with you about this project. Then I'll be happy. I wait for your good reply. Thanks.

$300 USD in 3 days

5.0

(14 reviews)

4.2

@billcolclinton

Hello. First, I hope you and your family will be happy new year!. I have read your project description in details. If you have interesting me, we can discuss on chatting more details. I never will disappoint. If you can believe me, please send message to me. I will wait your good news. Good luck...

$555 USD in 10 days