Tree (data structure) - Wikipedia

In terms of type theory, a tree is an inductive type defined by the constructors nil (empty forest) and node (tree with root node with given value and children). Viewed as a whole, a tree data structure is an ordered tree, generally with values attached to each node.