Binary Tree

gistfile1.hs

data BinaryTree a = BinaryNode a (BinaryTree a) (BinaryTree a) | BinaryNullNode

instance Show a => Show (BinaryTree a) where
	show BinaryNullNode = " null"
	show (BinaryNode a l r) = " (" ++ show a ++ show l ++ show r ++ ")" 

search BinaryNullNode _ = False
search (BinaryNode a l r) v
	| v == a = True
	| v < a = search l v
	| v > a = search r v


addValue v BinaryNullNode = BinaryNode v BinaryNullNode BinaryNullNode
addValue v (BinaryNode a l r)
	| v == a = BinaryNode a l r
	| v < a = BinaryNode a (addValue v l) r
	| v > a = BinaryNode a l (addValue v r)

buildFromList [] t = t
buildFromList (x:xs) t = buildFromList xs (addValue x t)

build l = buildFromList l BinaryNullNode