Another toy program to traverse a binary tree in depth-first order.

module Main where

main = traverse((Tree (Node 'a') (Tree (Node 'c') (Node 'b'))))

data Tree = Node Char | Tree Tree Tree

traverse :: Tree -> IO ()
traverse (Node n) = print n
traverse (Tree l r) = do traverse l
                         traverse r