Haskell programming small assignment
$10-30 USD
Płatność przy odbiorze
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.
Numer ID Projektu: #12965372
O projekcie
6 freelancerów złożyło ofertę za $62 w tym projekcie
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.
hello, place your confidence in my Haskell / BST knowledge and experience. your requirements are easy to follow. let's discuss a solution. greets, srdjan
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