Problem 6(b)

Please code in language: OCAML

Starter Code:

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

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

(b) A tree is a degenerate if all the nodes are arranged in a single path. Equivalently, a tree is degenerate if all nodes have at least one leaf child. Define an OCaml func- tion degenerate : 'a binTree -> bool which returns true if and only if the tree supplied is degenerate.4 (b) A tree is a degenerate if all the nodes are arranged in a single path. Equivalently, a tree is degenerate if all nodes have at least one leaf child. Define an OCaml func- tion degenerate : 'a binTree -> bool which returns true if and only if the tree supplied is degenerate.4