this is haskell

you may need to open the image in a new tab its way too large

The following binary tree t, as defined in Chapter 7, would be represented as: 10 6 14 2 8 12 18 O a. t = Node (Node (Leaf 2) 6 (Leaf 8)) 10 (Node (Leaf 12) 14 (Leaf 18)) b.t:: Tree Int, and t = Node (Node (Leaf 2) 6 (Leaf 8)) 10 (Node (Leaf 12) 14 (Leaf 18)) Oct :: Tree Int, and t = Node (Node (Leaf 10) 6 (Leaf 14)) 2 (Node (Leaf 8) 12 (Leaf 18)) O d. t:: Tree Int, and t = Node (Node (Leaf 18) 14 (Leaf 12) 10 (Node (Leaf 8) 6 (Leaf 2)) None of the above