***LANGUAGE IS SCHEME (R5RS)***

In this problem set you will write code for binary trees. Recall the conventions we have adopted in class for maintaining trees. We represent the empty tree with the empty list (); a nonempty tree is represented as a list of three objects (value left-subtree right-subtree) where value is the value stored at the root of the tree, and left-subtree and right-s are the two subtrees. We introduced some standardized functions for maintaining and accessing this structure, which we encourage you to use in your solutions below. ubtree (define (make-tree value left right) (list value left right)) (define (value tree) (car tree)) (define (left tree) (cadr tree)) (define (right tree) (caddr tree))