- Dr. Alistair Ward
- Defines a specific type of tree-structure, which is composed from either a datum, or a list of Tree-lists; http://en.wikipedia.org/wiki/Rose_Tree.
- This more general tree-structure has the shape of a regular-expression match.
- This contrasts with the typical binary-tree, which is either empty, or contains a (left Tree, datum, right Tree).
A general purpose tree-type structure.
|Node [TreeList a]|
Recurse. NB: a list of lists is required to contain the MatchLists resulting from repeated Alternatives.