[Haskell-cafe] inserting values in a binary tree

[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