hardentoo

module BinaryTree 
  where

-- Haskell Binary Tree Examples

-- A binary tree can either be empty or a node with a left and right branch

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