Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Problem 4(b) Please code in language: OCAML Starter Code: type 'a binTree = | Leaf | Node of 'a * ('a binTree) * ('a binTree)
Problem 4(b)
Please code in language: OCAML
Starter Code:
type 'a binTree = | Leaf | Node of 'a * ('a binTree) * ('a binTree)
let rec foldT (f: 'a -> 'b -> 'b -> 'b) (t: 'a binTree) (base: 'b) : 'b =
Problem 4. Define a polymorphic data type called 'a binTree as follows: type 'a binTree = | Leaf | Node of 'a * ('a binTree) * l'a binTree) Trees of this type will contain a single piece of data of type 'a at each node, and no data at their leaves. (b) Define an OCaml function foldt : l'a -> 'b -> 'b -> 'b) -> 'a binTree -> ' -> 'b which operates on trees the same way that foldr operates on lists. In other words, the base item of type 'b should replace the leaf constructor in the tree, and the function of type 'a -> 'b -> 'b -> 'b should replace the node constructor in the tree.3 Problem 4. Define a polymorphic data type called 'a binTree as follows: type 'a binTree = | Leaf | Node of 'a * ('a binTree) * l'a binTree) Trees of this type will contain a single piece of data of type 'a at each node, and no data at their leaves. (b) Define an OCaml function foldt : l'a -> 'b -> 'b -> 'b) -> 'a binTree -> ' -> 'b which operates on trees the same way that foldr operates on lists. In other words, the base item of type 'b should replace the leaf constructor in the tree, and the function of type 'a -> 'b -> 'b -> 'b should replace the node constructor in the tree.3Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started