數(shù)據(jù)結(jié)構(gòu)課程設(shè)計(jì)二叉排序樹(shù)查找C語(yǔ)言代碼1含測(cè)試序列

1、數(shù)據(jù)結(jié)構(gòu)課程設(shè)計(jì)二叉排序樹(shù)查找C語(yǔ)言代碼1含測(cè)試序列#include stdio. h #include stdlib h #include ，zmalloc h typedef int KeyType; typedef structKeyType key;DataType;typedef struct node DataType data;struct node *leftChild; struct node *rightChild; BiTreeNode;BiTreeNode *root=NULL; DataType a20, item; int i,n, num=0;/*査找*/void

2、 Search(BiTreeNode *root, DataType item)BiTreeNode *p;辻(root!=NULL)p=root;while(p!=NULL)if (p-data key二二item. key) break;num=l;if(item. keyp-data. key) p=p-rightChiId;elsep = pleftChild;if(p二二NULL)num二0;if (numl)for(i=0;idata keyleftChiId;p=(BiTreeNode *)malloc(sizeof(BiTreeNode);if(p二二NULL)printf(，

3、zLack of space!);exit(l);p-data=item;p-leftChild二NULL;p-rightChild=NULL;if(parent二二NULL) *root=p;else if(item. keydata key) parent-leftChild=p;else parent-rightChi1d=p;return 1;/*插入數(shù)組*/void InsertN()printf (Please enter some integer：nz，);for(i=0;i20;i+)scanf (，/%d，/，&ai);if (ai. key=-l) /*判斷是否非數(shù)字*/n

4、=i;break;else if(ail. key0. n);i；if (i=19) n 二 20;break;printf (，znThe number you entered are:n，z):for(i=0;ileftChiId!二NULL)InTraverse(root-leftChild);printf (z/%d , root-data key);if(root-rightChiId!=NULL)InTraverse(root-rightChiId) ; /*刪除*/ /*DataType item*/void Destroy ()/*BiTreeNode *root:辻(*roo

5、t)!=NULL&(*root)-leftChild!=NULL)Destroy(&(*root)-leftCh訂d); if(*root)!=NULL&(*root)-Might Chi Id!二NULL)Destroy(&(*root)-rightChiId); free(*root);*/printf (Destory has been finished!z/);/*打印二叉樹(shù)*/void PrintBiTree(BiTreeNode *bt, int n) if (bt二二NULL)return;PrintBiTree(bt-rightChild, n+1); for(i二0;i二0)

6、printf C”)；printf(%dn, bt-data);PrintBiTree(bt-leftChiId, n+1) ; /*主函數(shù)*/void main()int d, t二0;doprintf(n);printfC 1. Insert); /*y第二次插入的重復(fù)數(shù)字沒(méi)有被記錄，記錄了新的數(shù)字，相同數(shù)值被忽略*/printf C 2. Searchll);printf (，z 3. Destroyn);printf C 4. Printnz，);printf C 5. InTraversen); /*y*/printf C 6. Exit! nnz/);printf (Input c

7、ommand number:n，z): scanf (%d, &d);switch(d)case 1: InsertNO ; break;case 2:printf Cn Search number: n，z):scanf&item key);Search (root, item);break;case 3： /*判斷是否存在該數(shù)值*/printf (Destroy number: nz/); scanf (，z%d，z, &item. key);Search(root, item);if (num=0)printf (Destroy could not be done n);break;el

8、seDestroy ();break;case 4: PrintBiTree(root, 0): break;case 5: InTraverse (root): break;case 6: t=l: break;default: printf(The number should between 1 and 6. n); while(!t);測(cè)試序列二義排療;樹(shù)查找1 Insert2. Search3. Destroy4. Print3. InTraverse6. Exit!Input command number:Please enter some integer:1105032576940

9、88-1The number you entered are:10 50 32 5 76 9 40 881 Insert2. Search3. Destroy4. Print5. InTraverse6. Exit!Input command number:48876504032一一一1051. Insert2. Search3. Destroy4. Print3. InTraverse6. Exit!Input command number: 2Search number: 9Element 9 exists in a5J1. Insert2. Search3. Destroy4. Print5. InTraverse6. Exit!Input command number: 1Please enter some integer:1206-1The number you entered are:6. Exit!120 61.Insert2.Search3.Destroy4.Print5.InTraverse6.Exit!Input command number: 41208876504032一10一 01.Insert2.Search