 |
|
 |
|
|
|
|
Introduction: In this section we meet the type of graph referred to as a tree. Many definitions that will be used later are introduced here, as well as some elementary properties of trees. Some of these properties are very important in computer applications.
| Ancestors Balanced tree Binary tree Center of a tree Child Descendants |
Forest Height of a tree Internal vertices Leaves of a tree Level number m-ary tree |
Parent Prufer sequence Root of a tree Rooted tree Siblings Tree |
1. There are a multitude of new terms in this section. You should learn their definitions, because we will use all of them at some point in our study.
2. The four theorems (and their corollaries) are basic and should be well understood.
3. We will do several applications and problems in class that should help you with the homework problems.