On Tue, Jan 20, 2015 at 6:23 PM, Rustom Mody <rustompmody at gmail.com> wrote: > The Haskell is bullseye¹ in capturing the essense of a tree because > conceptually a tree of type t is recursive in the sense that it can contain > 2 subtrees -- (B x lst rst) -- or its a base case -- L x. How do you create a tree containing an even number of elements under this constraint?