Problem 6(c)

Please code in language: OCAML

Starter code:

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

let treeToList (t : 'a binTree) : 'a list option = (* your work here *) None

(c) Define a function treeToList (t : 'a bintree) : ('a list) option. If the sup- plied tree is degenerate, the function should return Some 1, where l corresponds to a list constructed by replacing the Node constructors with (::) constructors and replac- ing the Leaf constructors with the [] constructor where appropriate. If the supplied tree is not degenerate, the function should return None. You are encouraged to use degenerate and foldt to implement this function.5 (c) Define a function treeToList (t : 'a bintree) : ('a list) option. If the sup- plied tree is degenerate, the function should return Some 1, where l corresponds to a list constructed by replacing the Node constructors with (::) constructors and replac- ing the Leaf constructors with the [] constructor where appropriate. If the supplied tree is not degenerate, the function should return None. You are encouraged to use degenerate and foldt to implement this function.5