23 Jul
2011
23 Jul
'11
10:27 p.m.
2) One possibility is just have it being (Node x _ _) >>= f = f x
It does not follow monad laws (right identity to be more precise): (Node 1 (Node 2 Empty Empty) Empty) >>= return ≡ return 1 ≡ Node 1 Empty Empty ≠ (Node 1 (Node 2 Empty Empty) Empty) Regards