Warp wrote:
> It's not a dynamic data container, like a list or a tree.

Remember that in Haskell these are defined recursively. So a "tree" in this 
case is union { struct { tree*left, tree*right }, struct { node data } }

A list is
union { struct {node data, list* next} , struct {node data} }

I.e., what he's calling "tree" would be "node of a tree" in C.

-- 
Darren New, San Diego CA, USA (PST)
   Serving Suggestion:
     "Don't serve this any more. It's awful."

Post a reply to this message