离散数学课件7.2 applications of tree 7.3 tree traversal.pptVIP

In the postfix form of an expression, a binary operator precedes its two operands. Hence, we can evaluate an expression in postfix form by working from left to right. Example What is the value of the postfix expression 723 ? ? 4?93/+? 7 23? ? 4?93/+ 76 ? 4?93/+ 14?93/+ 1 93/+ The value of this expression is 4 Example Find the ordered rooted tree representing the compound proposition (? (p ? q)) ?(? p ?? q). Then use this rooted tree to find the prefix, postfix, and infix forms of this expression. ? ? ? ? ? ? p q p q Prefix form: ?? ?pq ? ? p ? q Postfix form: pq??p?q??? Infix form: (? (p ? q)) ?(? p ?? q) Section 7.4 Trees and Sorting The bubble sort The merge sort The bubble sort Example Use the bubble sort to put 3,2,4,1,5 into increasing order. Solution 2,3,1,4,5 2,1,3,4,5 1,2,3,4,5 The merge sort 8 2 4 6 9 7 10 1 5 3 8 2 4 6 9 7 10 1 5 3 8 2 4 6 9 7 10 1 5 3 8 2 4 8 2 7 10 1 7 10 6 9 5 3 1 2 3 4 5 6 7 8 9 10 2 4 6 8 9 1 3 5 7 10 2 4 8 6 9 1 7 10 3 5 2 8 4 8 2 7 10 1 7 10 6 9 5 3 Lemma Two sorted lists with m elements and n elements can be merged into a sorted list using no more than m+n-1 comparisons. Theorem The number of comparisons needed to merge-sort a list with n elements is O(nlog n). Section 7.2 Application of Tree Introduce We will discuss three problems that can be studied using trees. How should items in a list be stored so that an item can be easily located? What series of decisions should be made to find an object with a certain property in a collection of objects of a certain type? How should a set of characters be efficiently coded by its bit strings? Binary search trees Binary search tree is a binary tree in which the vertices are labeled with items so that a label of a vertex is greater than the labels of all vertices in the left subtree of this vertex and is less than the labels of all vertices in the right subtrees of this vertex. Example: Form a binary search tree for the words ma