5b

Please code in language: Ocaml

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.

(b) Define an OCaml function nodeCount : a binTree -> int which returns an integer representing the total number of non-leaf nodes in a tree.

starter code:

type 'a binTree = | Leaf | Node of 'a * ('a binTree) * ('a binTree)

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