Blogger - Folding tree - 1 (Haskell)

module TreeToList (Tree (Empty, Node), toList) where

data Tree a = Empty | Node a (Tree a) (Tree a) deriving (Show)

toList :: Tree a -> [a]
toList Empty               = []
toList (Node a left right) = (toList left) ++ a : toList right