數(shù)據(jù)結構實驗——查找算法的實現(xiàn)[谷風軟件]

1、實驗五查找算法實現(xiàn)1、實驗目的熟練掌握順序查找、折半查找及二叉排序樹、平衡二叉樹上的查找、插入和刪除的方法，比較它們的平均查找長度。2、問題描述查找表是數(shù)據(jù)處理的重要操作， 試建立有100個結點的二叉排序樹進行查找，然后用原數(shù)據(jù)建立AVL樹， 并比較兩者的平均查找長度。3、基本要求（1） 以鏈表作為存儲結構，實現(xiàn)二叉排序樹的建立、查找和刪除。（2） 根據(jù)給定的數(shù)據(jù)建立平衡二叉樹。4、測試數(shù)據(jù)隨即生成5、源程序#include#include#include#define EQ(a,b) (a)=(b) #define LT(a,b) (a)(b)typedef int Keytype;type

2、def struct Keytype key; /關鍵字域ElemType;typedef struct BSTnode ElemType data; int bf; struct BSTnode *lchild,*rchild; BSTnode,*BSTree;void InitBSTree(BSTree &T)T=NULL;void R_Rotate(BSTree &p)BSTnode *lc; lc=p-lchild; p-lchild=lc-rchild; lc-rchild=p; p=lc; void L_Rotate(BSTree &p)BSTnode *rc; rc=p-rchi

3、ld; p-rchild=rc-lchild; rc-lchild=p; p=rc; void Leftbalance(BSTree &T)BSTnode *lc,*rd; lc=T-lchild; switch(lc-bf) case +1: T-bf=lc-bf=0; R_Rotate(T); break; case -1: rd=lc-rchild; switch(rd-bf) case 1: T-bf=-1; lc-bf=0; break; case 0: T-bf=lc-bf=0; break; case -1: T-bf=0; lc-bf=1; break; rd-bf=0; L_

4、Rotate(T-lchild); R_Rotate(T); void Rbalance(BSTree &T)BSTnode *lc,*ld; lc=T-rchild; switch(lc-bf) case 1: ld=lc-lchild; switch(ld-bf) case 1: T-bf=0; lc-bf=-1; break; case 0: T-bf=lc-bf=0; break; case -1: T-bf=1; lc-bf=0; break; ld-bf=0; R_Rotate(T-rchild); L_Rotate(T); case -1: T-bf=lc-bf=0; L_Rot

5、ate(T); break; int InsertAVL(BSTree &T,ElemType e,bool &taller) if(!T) T=(BSTree)malloc(sizeof(BSTnode); T-data=e; T-lchild=T-rchild=NULL; T-bf=0; taller=true; else if(EQ(e.key,T-data.key) taller=false; cout結點 e.key 不存在。data.key) if(!InsertAVL(T-lchild,e,taller) return 0; if(taller) switch(T-bf) cas

6、e 1: Leftbalance(T); taller=false; break; case 0: T-bf=+1; taller=true; break; case -1: T-bf=0; taller=false; break; else if(!InsertAVL(T-rchild,e,taller) return 0; if(taller) switch(T-bf) case 1: T-bf=0; taller=false; break; case 0: T-bf=-1; taller=true; break; case -1: Rbalance(T); taller=false; b

7、reak; return 1;bool SearchBST(BSTree T,ElemType key,BSTree f,BSTree &p) if(!T) p=f; cout結點不存在。data.key) ) p=T; cout查找成功，存在結點; coutdata.keydata.key) return SearchBST(T-lchild,key,T,p); else return SearchBST(T-rchild,key,T,p);void Leftbalance_div(BSTree &p,int &shorter) BSTree p1,p2; if(p-bf=+1) /p結點的

8、左子樹高，刪除結點后p的bf減1,樹變矮 p-bf=0; shorter=1; else if(p-bf=0)/p結點左、右子樹等高，刪除結點后p的bf減1,樹高不變 p-bf=-1; shorter=0; else p1=p-rchild;/p1指向p的右子樹 if(p1-bf=0)/p1結點左、右子樹等高,刪除結點后p的bf為-2,進行左旋處理，樹高不變 L_Rotate(p); p1-bf=1; p-bf=-1; shorter=0; else if(p1-bf=-1)/p1的右子樹高，左旋處理后，樹變矮 L_Rotate(p); p1-bf=p-bf=0; shorter=1; els

9、e p2=p1-lchild; p1-lchild=p2-rchild; p2-rchild=p1; p-rchild=p2-lchild; p2-lchild=p; if(p2-bf=0) p-bf=0; p1-bf=0; else if(p2-bf=-1) p-bf=+1; p1-bf=0; else p-bf=0; p1-bf=-1; p2-bf=0; p=p2; shorter=1; void Rbalance_div(BSTree &p,int &shorter) BSTree p1,p2; if(p-bf=-1) p-bf=0; shorter=1; else if(p-bf=0)

10、 p-bf=+1; shorter=0; else p1=p-lchild; if(p1-bf=0) R_Rotate(p); p1-bf=-1; p-bf=+1; shorter=0; else if(p1-bf=+1) R_Rotate(p); p1-bf=p-bf=0; shorter=1; else p2=p1-rchild; p1-rchild=p2-lchild; p2-lchild=p1; p-lchild=p2-rchild; p2-rchild=p; if(p2-bf=0) p-bf=0; p1-bf=0; else if(p2-bf=1) p-bf=-1; p1-bf=0;

11、 else p-bf=0; p1-bf=1; p2-bf=0; p=p2; shorter=1; void Delete(BSTree q,BSTree &r,int &shorter) if(r-rchild=NULL) q-data=r-data; q=r; r=r-lchild; free(q); shorter=1; else Delete(q,r-rchild,shorter); if(shorter=1) Rbalance_div(r,shorter); ElemType DeleteAVL(BSTree &p,ElemType key,int &shorter) ElemType

12、 k,a,b; a.key=1; b.key=0; BSTree q; if(p=NULL) cout結點不存在。data.key) )/在p的左子樹中進行刪除 k=DeleteAVL(p-lchild,key,shorter); if(shorter=1) Leftbalance_div(p,shorter); return k; else if(LQ(key.key,p-data.key) )/在p的右子樹中進行刪除 k=DeleteAVL(p-rchild,key,shorter); if(shorter=1) Rbalance_div(p,shorter); return k; els

13、e q=p; if(p-rchild=NULL) /右子樹空則只需重接它的左子樹 p=p-lchild; free(q); shorter=1; else if(p-lchild=NULL)/左子樹空則只需重接它的右子樹 p=p-rchild; free(q); shorter=1; else Delete(q,q-lchild,shorter); if(shorter=1) Leftbalance_div(p,shorter); p=q; return a; void Print_BSTTree(BSTree T,int i) if(T) if(T-rchild) Print_BSTTree

14、(T-rchild,i+1); for(int j=1;j=i;j+) cout ; coutdata.keylchild) Print_BSTTree(T-lchild,i+1); int main() BSTree T; ElemType e; InitBSTree(T); bool tall=false; bool choice=true; char y; while(choice) coute.key; InsertAVL(T,e,tall); Print_BSTTree(T,0); couty; if(y=Y|y=y) choice=true; else choice=false; BSTree f,p; choice=true; while(choice) coute.key; SearchBST(