a full binary tree is one in which, for every node, the maximum depth of its left subtree is the same as the maximum depth of its right subtree. write a function isfull of type tree a -> bool that tests whether a tree is full. (use the tree definition from exercise 11.9 in your text. the haskell version is given below.) run the following test, and turn in a listing of your function, and the results of the test run
data Tree dta = Empty I Node (Tree dta, dta, Tree dta) (isFu11 (Node (Node (Empty, "
f n
, Empty), "e", Node (Empty, "d", Empty))), (Node (Node (Empty, "d", Node (Empty, "f", Empty)),"e", Empty)))