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

* * College of Computer Science Technology, BUPT Backtracking applications Graph colorings * * College of Computer Science Technology, BUPT Backtracking applications The n-Queens Problem * * College of Computer Science Technology, BUPT Backtracking applications Sums of Subsets * * College of Computer Science Technology, BUPT Depth-first search in directed graphs Example 9 Web Spiders * * College of Computer Science Technology, BUPT §10.4 12, 14 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 Tree Traversal * * College of Computer Science Technology, BUPT Content Universal address systems Traversal algorithms Depth-first traversal: Preorder traversal Inorder traversal Postorder traversal Breadth-first traversal Infix/prefix/postfix notation * * College of Computer Science Technology, BUPT Universal address systems Label all the vertices Label the root with the integer 0. Then label its k children from left to right with 1,2,…k. For each vertex v at level n with label A, label its kv children, as they are drawn from left to right, with A.1,A.2,…A. kv. Example 1 * * College of Computer Science Technology, BUPT * * College of Computer Science Technology, BUPT Traversal algorithms Procedures for systematically visiting every vertex of an ordered rooted tree are called traversal algorithms. Preorder traversal Inorder traversal Postorder traversal * * College of Computer Science Technology, BUPT Preorder traversal Definition 1 Let T be an ordered rooted tree with root r. If T consists only of r, then r is the preorder traversal of T . Otherwise, suppose that T1, T2, . . . , Tn are the subtrees at r from left to right in T . The preorder traversal begins by visiting r. It continues by traversing T1 in preorder, then T2 in preorder, and so on, until Tn is traversed in preorder. * *