data Tree a = Nil | Node a (Tree a) (Tree a)
                    deriving (Eq, Ord, Show, Read)
             

mapTree:: (a -> b) -> Tree a -> Tree b
mapTree f Nil = Nil
mapTree f (Node x t1 t2)
    = Node (f x) (mapTree f t1) (mapTree f t2)