data Tree a = Leaf a
            | Tree (Tree a) (Tree a)
  deriving (Show)

reverseTree (Leaf a) = Leaf a
reverseTree (Tree left right) = Tree (reverseTree right) (reverseTree left)

【 在 xeagle 的大作中提到: 】
: 能贴一下具体的代码, 让我感受一下吗?
: 从小被过程式编程毒害太深了, 现在学习函数式编程很费劲.
--
FROM 27.38.228.*