inorder : Tree a -> List a inorder tree = case tree of Empty -> [] Node v l r -> (inorder l) ++ [v] ++ (inorder r)
Back to problem