[Haskell-cafe] inserting values in a binary tree
lennart at augustsson.net
Fri May 9 18:43:42 EDT 2008
Are there any invariants you wish to maintain when inserting? If not, it's
On Fri, May 9, 2008 at 11:35 PM, PR Stanley <prstanley at ntlworld.com> wrote:
> 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?
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe