6a

Please code in language Ocaml

(a) TODO: A tree is perfect if all the leaves of the tree are at the same depth. Define an OCaml function perfect : a binTree -> bool which returns true if the tree supplied is perfect and false otherwise. You may use any approach to implement this function

starter code:

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

let perfect (t : 'a binTree) : bool = (* your work here *) true