Programming by Tree Structure

A tree can be defined recursively. A tree is a collection of n vertices. The collection can be empty (n == 0); otherwise, a tree constitutes a distinguished vertex r, called the root, and zero or more nonempty subtrees that the root of each subtree is a child of r, and r is the parent of each subtree root.