9 May
2008
9 May
'08
6:43 p.m.
Are there any invariants you wish to maintain when inserting? If not, it's
rather trivial.
-- Lennart
On Fri, May 9, 2008 at 11:35 PM, PR Stanley
Hi data Ord a => Tree a = Nil | Node (Tree a) a (Tree a) How would one go about inserting a value in a binary search tree of the above description?
Cheers Paul
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe