Problem 5

Please code in language: OCAML

Starter Code:

let leafCount (t : 'a binTree) : int = (* your work here *) 0

let nodeCount (t : 'a binTree) : int =(* your work here *) 0

let height (t : 'a binTree) : int = (* your work here *) 0

Problem 5. In each of the three parts in this problem, you will get full credit if you use foldt and define at most one helper function. (a) Define an OCaml function leafCount : 'a binTree -> int which returns an inte- ger representing the total number of leaves in a tree. (b) Define an OCaml function nodeCount : 'a binTree -> int which returns an inte- ger representing the total number of non-leaf nodes in a tree. (c) Define a function height : 'a binTree -> int which returns an integer represent- ing the height of the tree. Trees consisting of only a leaf have height 0. Problem 5. In each of the three parts in this problem, you will get full credit if you use foldt and define at most one helper function. (a) Define an OCaml function leafCount : 'a binTree -> int which returns an inte- ger representing the total number of leaves in a tree. (b) Define an OCaml function nodeCount : 'a binTree -> int which returns an inte- ger representing the total number of non-leaf nodes in a tree. (c) Define a function height : 'a binTree -> int which returns an integer represent- ing the height of the tree. Trees consisting of only a leaf have height 0