introduction trees

See that how a program performs for reasonably large input is just as important as its performance on moderate amounts of input.
Summarize the basic mathematical background needed for the rest of the book.
Briefly review recursion.
Summarize some important features of C++ that are used throughout the text.

A tree can be defined in several ways. One natural way to define a tree is recursively. A tree is a collection of nodes. The collection can be empty; otherwise, a tree consists of distinguished node, r, called the root, and zero or more nonempty subtrees T1, T2, Tk, each of whose roots are connected by a directed edge from r.
The root of each subtree is said to be a child of r, and r is the parent of each subtree root..
In the tree of 4.2, the root is A, Node F has A as a parent and K, L, and M as children. Each node may have an arbitrary number of children, possibly zero. Nodes with nochildren are known as leaves; the leaves in the tree above are B, C, H.Nodes with the same parent are siblings; Grandparent and grandchild relations can be defined in a similar manner.
A path from node n1 to nk is defined as a sequence of nodes n1....... The length of this path is the number of edges on the path. Notice that in a tree there is exactly one path from the root to each node.
For any node ni, the depth of ni is the length of the unique path from the root to ni. Thus, the root is at depth 0, The height of ni isthe length of the longest path from ni to a leaf.
if there is a path from n1 to n2, then n1 is an ancestor of n2 and n2 is a descendant of n1. if n1!= n2, then n1 is a proper ancestor of n2 and n2 is a proper descendant of n1.