HaskellCourse/tree.hs

data BinaryTree = Leaf | Node Integer BinaryTree BinaryTree

height bigTree = case bigTree of
	Leaf -> 0
	Node _ leftTree rightTree -> 1 + max (height leftTree) (height rightTree)