数据结构-二叉查找树.pptVIP

* §6 The Search Tree ADT -- Binary Search Trees 【Definition】A binary search tree is a binary tree. It may be empty. If it is not empty, it satisfies the following properties: (1) Every node has a key which is an integer, and the keys are distinct(唯一的). (2) The keys in a nonempty left subtree must be smaller than the key in the root of the subtree. (3) The keys in a nonempty right subtree must be larger than the key in the root of the subtree. (4) The left and right subtrees are also binary search trees. 30 5 2 40 20 15 12 25 10 22 60 70 80 65 1. Definition §6 Binary Search Trees 2. A