Data Structures, Algorithms, & Applications in C++
Chapter 11, Exercise 1
The diagram of Figure 11.1 satisfies the definition of a tree.
The element set is {Joe, Ann, Mary, John, Mark, Sue, Chris}.
This is a finite nonempty set.
The root node is the node for Joe.
The remaining elements are partitioned into 3 subtrees (the fact that these are
subtrees may be verified recursively).
The root is Joe, its degree is 3 and its level is 1.
The level 2 nodes are Ann, Mary and John and the level 3 nodes are Mark, Sue, and Chris.
The degrees of Ann, Mary, John, Mark, Sue and Chris are, respectively,
0, 2, 1, 0, 0, 0.
The depth or height of the tree is 3.