Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
AUTHOR
- Dr. Alistair Ward
DESCRIPTION
- Defines a specific type of tree-structure, which is composed from either a datum, or a list of Tree-lists; https://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).