【精品数据结构】Search Trees.ppt.pptVIP

Chapter 11 Search Trees 11.1 Binary Search Trees 1.Definition: A binary search tree is a binary tree that may be empty.A nonempty binary search tree satisfies the following properties: 1)Every element has a key and no two elements have the same key; therefore,all keys are distinct. 11.1 Binary Search Trees 2)The keys(if any)in the left subtree of the root are smaller than the key in the root. 3)The keys(if any)in the right subtree of the root are larger than the key in the root. 4)The left and right subtrees of the root are also binary search trees. 11.1 Binary Search Trees Example: 11.1 Bina