@@ -24,7 +24,7 @@ insert x (Node l v r) = if (x < v) then (Node (insert x l) v r)
25toList : BTree a -> List a
25toList : BTree a -> List a
26toList Leaf = []
26toList Leaf = []
27−toList (Node l v r) = app (toList l) (v :: toList r)
27+toList (Node l v r) = toList l ++ (v :: toList r)
29toTree : Ord a => List a -> BTree a
29toTree : Ord a => List a -> BTree a
30toTree [] = Leaf
30toTree [] = Leaf