数据结构与算法英文课件Chap7 BST.ppt

7-4 BST Applications This section develops two applications that use the BST ADT. We begin the discussion of BST Applications with a simple application that manipulates integers. The second application, student list, requires a structure to hold the students data. Integer Application homework P337 1-10 12-14 Problem: Store ordered data in an array structure : efficient search algorithm, inefficient insertion and deletion Linked list: efficient insertion and deletion ,inefficient search Binary search trees can satisfy both of them * Right-node-left sequence * Far-left leaf node * Regardless of which will be moving data from a leaf or leaflike node. Prove to yourself that either of these moves will preserve the integrity of the binary search tree. * College of Electronic and Information Engineering Chongqing University of Science and Technology Instructor: Xiong Qian Spring 2013 Data Structures and Algorithms Chapter 7: Binary Search Trees Chapter 7 Objectives  Upon completion you will be able to: Create and implement binary search trees Understand the operation of the binary search tree ADT Write application programs using the binary search tree ADT Design and implement a list using a BST Binary Search Trees highlights 7-1 Basic Concepts 7-2 BST Operations 7-3 Binary Search Tree ADT 7-4 BST Applications 7-1 Basic Concepts Binary search trees provide an excellent structure for searching a list and at the same time for inserting and deleting data into the list. definition A binary search tree is a binary tree with the following properties: All items in the left subtree are less than the root All items in the right subtree are greater than or equal to the root Each subtree is itself a binary search tree. (a) (d) (c) (b) 17 17 6 19 17 19 6 14 3 17 6 3 17 19 22 (e) Figure binary search trees (a) (d) (c) (b) 17 6 11 17 19 6 22 3 17 22 19 17 19 6 15 11 Figure invalid binary search trees 7-2 B