北京邮电大学计算机学院--离散数学-11.1-trees.pptVIP

College of Computer Science Technology, BUPT Yang Juan yangjuan@bupt.edu.cn College of Computer Science Technology Beijing University of Posts Telecommunications Discrete Mathematical Structures Trees（树） * * College of Computer Science Technology, BUPT 家谱 图书十进制分类 一个组织结构的层次体系 各种运算表达式 判断树 Application * * College of Computer Science Technology, BUPT * * College of Computer Science Technology, BUPT Training Dataset This follows an example from Quinlan’s ID3 * * College of Computer Science Technology, BUPT Output: A Decision Tree for “buys_computer” age? overcast student? credit rating? no yes fair excellent =30 40 no no yes yes yes 30..40 * * College of Computer Science Technology, BUPT Presentation of Classification Results * * College of Computer Science Technology, BUPT Visualization of a Decision Tree in SGI/MineSet 3.0 * * College of Computer Science Technology, BUPT §11.1: Introduction to Trees A tree is a connected undirected graph with no simple circuits. Theorem: There is a unique simple path between any two of its vertices. A (not-necessarily-connected) undirected graph without simple circuits is called a forest. You can think of it as a set of trees having disjoint sets of nodes. A leaf node in a tree or forest is any pendant or isolated vertex. An internal node is any non-leaf vertex (thus it has degree ≥ ___ ). * * College of Computer Science Technology, BUPT Tree and Forest Examples A Tree: A Forest: Leaves in green, internal nodes in brown. * * College of Computer Science Technology, BUPT Rooted Trees A rooted tree is a tree in which one node has been designated the root. Every edge is (implicitly or explicitly) directed away from the root. You should know the following terms about rooted trees: Parent, child, siblings, ancestors, descendents, leaf, internal node, subtree. * * College of Computer Science Technology, BUPT Rooted Trees If v is a vertex in T other than the root, the parent of v is the unique vertex u such that there is a d