李秀成传word.pptVIP

二叉查找(排序)树(Binary Search Trees / Binary Sort Trees) 定义(P227): A binary search tree is a binary tree that is either empty or in which every node contains a key and satisfies the conditions: 1. The key in the left child of a node(if exists) is less than the key in its parent node. 2. The key in the right child of a node(if exists) is greater than the key in its parent node. 3. The left and right subtrees of the root are again binary search trees. c g d a f b e 约定: No two entries in a binary search tree may have equal keys. 特征: 对二叉查找树若按中序遍历，则得到一个非降序的有序序列。 运算/操作: 1. 查找: BTNode *BSTreeSearch(BTNode *root, KeyType target) 2. 插入/创建: BTNode *BSTInsertion(BTNode *root, BTNode *newnode) 3. 删除: BTNode *BSTDeletion(BTNode *root, BTNode *p) 算法分析: 参见Chapter 9 思考题: 实际应用中不能保证被查找的数据集合中各元素的关键字值互不相同, 那么上述定义应如何修改? Search From A Binary Search Tree //recursive version: P228 Algorithm 9.5(a) { if (root) if (LT(target, root-data)) root = BSTreeSearch(root-lchild, target); else if (GT(target, root-data)) root = BSTreeSearch(root-rchild, target); return root; } //recursion removal { p = root; while (p NE(target, p-data)) if (LT(target, p-data)) p = p-lchild; else p = p-rchild; return p; } BTNode *BSTreeSearch(BTNode *root, KeyType target) precondtion: The binary search tree to which root points has been created. postcondition: If an entry in the binary search tree has key equal to target, then the return value points to such a node; otherwise, the function returns NULL. Insertion Into A Binary Search Tree 基本思想：建立一棵二叉排序树, 实际上就是不断地进行插入新结点的运算。 设有一组数据{k1, k2, … ,kn}, 1. 先让k1做根； 2. 对于k2, 若k2k1, 则令k2做k1的左孩子, 否则令k2做k1的右孩子； 3. 对于k3, 从根k1开始比较, 若k3k1, 则到k1的左子树中继续比较, 否则到k1的右子树中继续比较, 如此循环, 直至一个合适位置时进行插入操作； 4. 对于剩下数据, 重复上述第3步。 例子: 设有一组数据{e, b, d, f, a, g, c} c g d a f b e g d a f b e d a f b e d f b e d b e b e e Insert c Insert g Insert a Insert f Insert d Insert b Inse