Question: I need help solving this part. It is in racket using the plait language. So don't try to use the match function. It won't work.


I need help solving this part. It is in racket using the plait language. So don't try to use the match function. It won't work. Thanks in advance.
The following Tree datatype implements a binary tree with a number in each node and leaf: (define-type Tree (leaf [val : Number]) (node [val : Number] [left : Tree] [right : Tree])) Implement the function contains?, which takes a tree and a number and returns \#t if the number is in the tree, \#f otherwise. Example: (contains? (node 5 (leaf 6) (leaf 7)) 6) should produce \#t. The second argument to the contains? function is "along for the ride
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
