hamishdickson · March 6, 2017 17:30
diff --git a/binary.idr b/binary.idr
 -- binary search tree
 insert : Ord elem => elem -> Tree elem -> Tree elem
 insert x Empty = Node Empty x Empty
 insert x (Node left val right) = case compare x val of
                                      LT => Node (insert x left) val right
                                      EQ => Node left val right
                                      GT => Node left val (insert x right)
	-- binary search tree
	insert : Ord elem => elem -> Tree elem -> Tree elem
	insert x Empty = Node Empty x Empty
	insert x (Node left val right) = case compare x val of
	LT => Node (insert x left) val right
	EQ => Node left val right
	GT => Node left val (insert x right)