« Return to Thread: inserting values in a binary tree

Re: inserting values in a binary tree

by Lennart Augustsson :: Rate this Message:

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 <prstanley@...> wrote:

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@...
http://www.haskell.org/mailman/listinfo/haskell-cafe

_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@...
http://www.haskell.org/mailman/listinfo/haskell-cafe

« Return to Thread: inserting values in a binary tree