On Dec 5, 2007 12:16 AM, Aaron Denney <[EMAIL PROTECTED]> wrote: > > we (the FPSIG group) defined: > > data BTree a = Leaf a > > | Branch (BTree a) a (BTree a) > > Totally avoiding your question, but I'm curious as to why you > deliberately exclude empty trees. > > Come to think of it, how can you represent a tree with two elements?
Indeed, this tree is only capable of representing odd numbers of elements, which can be shown by straightforward induction. Luke _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
