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

* * College of Computer Science Technology, BUPT * * College of Computer Science Technology, BUPT Game Trees Nim Tic-tac-toe * * College of Computer Science Technology, BUPT * * College of Computer Science Technology, BUPT §11.2 6, 30 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 * * College of Computer Science Technology, BUPT §11.2: Applications of Trees Binary search trees A simple data structure for sorted lists Decision trees Minimum comparisons in sorting algorithms Prefix codes Huffman coding Game trees * * College of Computer Science Technology, BUPT Binary Search Trees A representation for sorted sets of items. Supports the following operations in Θ(log n) average-case time: Searching for an existing item. Inserting a new item, if not already present. Supports printing out all items in Θ(n) time. Note that inserting into a plain sequence ai would instead take Θ(n) worst-case time. * * College of Computer Science Technology, BUPT Binary Search Tree Format Items are stored at individual tree nodes. We arrange for the tree to always obey this invariant: For every item x, Every node in x’s left subtree is less than x. Every node in x’s right subtree is greater than x. 7 3 12 1 5 9 15 0 2 8 11 Example: * * College of Computer Science Technology, BUPT Recursive Binary Tree Insert procedure insert(T: binary tree, x: item)v := root[T]if v = null then begin  root[T] := x; return “Done” endelse if v = x return “Already present”else if x v then return insert(leftSubtree[T], x)else {must be x v} return insert(rightSubtree[T], x) * * College of Computer Science Technology, BUPT Decision Trees A decision tree represents a decision-making process. Each possible “decision point” or situation is represented by a node. Each possible choice that could be made at that decision point is represented by an