"" In clojure ""

Implement the binary tree procedures listed below. You can use any representation you like for a tree node but I recommend using a list or vector."" in clojure "" 1- (make-external val) make an external binary tree node that holds the value val 2- (make-internal val left right) make an internal binary tree node that holds the value val and has left and right as its corresponding sub-trees. 3- (internal? node) return true if node is an internal binary tree node, false otherwise. 4- (external? node) return true if node is an external binary tree node, false otherwise. 5- (value node) return the value stored in node. 6- (left node) return the left child of node if node is external, otherwise return nil. 7- (right node) return the right child of node if node is external, otherwise return nil. 8- (count node) return the number of nodes in the tree rooted at node.