[工学]第6讲 二叉树应用.ppt

二叉排序树(Binary Searching Tree), 或为空树,或为具有如下性质的一棵树: 若左子树非空, 则左子树上所有节点关键字均小于根节点的关键字; 若右子树非空, 则右子树上所有节点的关键字均大于根节点的关键字; 左右子树本身又各为一棵二叉排序树. ADT BinarySortingTree is Data: BTreeNode *BST; Operation: bool Find (BTreeNode *BST, ElemType x ) ; bool Update (BTreeNode *BST, const ElemType x ) ; void Insert (BTreeNode *BST, const ElemType x ) ; bool Delete (BTreeNode *BST, const ElemType x ) ; end BinarySortingTree bool Find (BTreeNode *BST, ElemType x) 查找过程: 若二叉树BST为空,则查找失败, 返回 false; 否则: 若 x 等于当前根节点的值(对于记录类型为关键字域的值)相等, 则查找成功, 用引用参数 x 带回根节点的值并返回真; 若x小于根节点值, 则继续在左子树上查找; 若x大于根节点值, 则继续在右子树上查找; bool Find (BTreeNode *BST, ElemType x) { if ( BST == NULL) return false ; else { if ( x == BST→data ) { x = BST→data ; return true ; } else if ( x BST→data) return Find ( BST→left , x ) ; else return Find ( BST→right , x ) ; } } bool Find ( BTreeNode *BST , ElemType x) { while ( BST != NULL ) { if ( x == BST→data ) { x = BST→data ; return true; } else if ( x BST→data ) BST = BST→left ; else BST = BST→right; } return false ; } 给定值同树中节点比较次数最少为1次(和根节点);最多为树的深度； 平均查找次数小于等于树的深度； 若为理想平衡树(除最后一层外,其余各层均满,且最后一层节点可任意分布)或接近理想平衡树,则进行查找的时间复杂度为：O ( log2n ) 最差为 O(n) (单分支树) ; 空间复杂度为 O ( 1 ) ; void Insert ( BTreeNode * BST, const ElemType x) 若二叉树BST为空,则由x元素生成的新节点做为根节点插入; 否则: 若x小于根节点, 则将新节点插入到根的左子树上; 若x大于根节点, 则将新节点插入到根的右子树上; void Insert (BTreeNode *BST,const ElemType x){ if ( BST == NULL) { BTreeNode *p = new BTreeNode ; p→data = x; p→left = p→right = NULL ; BST = p ; } else if ( x BST→data ) Insert ( BST→left , x ) ; else Insert ( BST→right , x ) ; } void Insert (BTreeNode *BST, const ElemType x){ BTreeNode *q = BST ; *p = NULL ; while ( q != NULL ) { p = q ; if ( x q→data ) q = q→left ; else q = q→right ; } BTreeNode *s = new BTreeNode ; s→data = x ; s→left = S→right = NULL ; if ( p == NULL ) BST = s ; else if ( s→data p→data ) p→left = s ; else p→right = s ; } void Insert(BTreeNode * BST , const ElemType x) { BTreeNode *q = BST, *p = NULL