离散数学课件(英文版)Trees课程.pptVIP

Trees Lecture 8 Discrete Mathematical Structures Rooted Tree Let A be a set, and let T be a relation on A. T is a rooted tree if there is a vertex v0 in A with the property that there exists a unique path in T from v0 to every other vertex in A, but no path from v0 to v0. Properties of Rooted Tree Let (T, v0) be a rooted tree. Then (a) There are no cycles in T. (b) v0 is the only root of T. (c) Each vertex other than the root has in-degree one, and the root has in-degree 0 Drawing a Rooted Tree by Levels Rooted Tree and Family Relations It is easy to describe the family relations，and on the o