数据结构课程设计二叉排序树查找C语言代码1含测试序列

数据结构课程设计二叉排序树查找C语言代码1含测试

序列

#include "stdio. h" #include "stdlib? h〃#include ，z malloc? h"

typedef int KeyType; typedef struct

{

KeyType key;

}DataType;

typedef struct node {

DataType data;

struct node *leftChild; struct node *rightChild; }BiTreeNode; BiTreeNode *root=NULL; DataType a[20], item; int i,n, num=0;

/*査找*/

void 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. key>p->data. key) {

p=p->rightChiId;

}

else

{

p = p~>leftChild;

}

if(p二二NULL)

{

num二0;

}

}

}

if (num~l)

{

for(i=0;i

{

if (item, key—a Li], key)

break;

}

printf (/?\n Element %d exists in a[%d] \n", item, key, i); } else

printf (z/\n Can，t find number %d! \n，z, item, key);

}

/*插入二叉树*/

int Insert(BiTreeNode **root, DataType item) {

BiTreeNode *current, *parent=NULL, *p;

current=*root;

while(current!=NULL)

{

if(current一〉data? key二二item? key) return 0;

parent二current;

if(current->data? keyleftChiId;

}

p=(BiTreeNode *)malloc(sizeof(BiTreeNode));

if(p二二NULL)

{

printf(，z Lack 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;

}

/*插入数组*/

void InsertN()

{

printf ("Please enter some integer：\n z，); for(i=0;i<20;i++)

{

scanf (，/%d，/，&a[i]);

if (a[i]. key=-l) /*判断是否非数字*/ {

n=i;

break;

}

else if(a[il. key<=0)

{

printf (z/Number must >0. \n");

i—；

}

if (i=19) n 二20;

break;

}

}

printf (，z\nThe number you entered are:\n，z): for(i=0;i

{

printf ("%d "，&[i]);

Insert(&root, aLi]) ; }

printf C\n");

}

/*中序遍历*/

void InTraverse(BiTreeNode *root) {

if(root==NULL)return;

辻(root->leftChiId!二NULL)

InTraverse(root->leftChild);

printf (z/%d ", root->data? key);

if(root->rightChiId!=NULL)

InTraverse(root->rightChiId) ; }

/*删除*/ /*DataType item*/

void Destroy ()

{

/*BiTreeNode **root:

辻((*root)!=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/);

}

/*打印二叉树*/

void PrintBiTree(BiTreeNode *bt, int n) {

if (bt二二NULL)return;

PrintBiTree(bt->rightChild, n+1); for(i二0;i二0)

{

printf C--- ”)；

printf("%d\n", bt->data);

}

PrintBiTree(bt->leftChiId, n+1) ; }

/*主函数*/

void main()

{

int d, t二0;

do

{

printf("\n");

printfC 1. Insert""); /*y第二次插入的重复数字没有被记录，记录了新的数字，相同数值被忽略*/

printf C 2. Search'll");

printf (，z 3. Destroy'n");

printf C 4. Print\n z，);

printf C 5. InTraverse'n"); /*y*/

printf C 6. Exit! \n\n z/);

printf ("Input command number:\n，z): scanf ("%d", &d);

switch(d)

case 1: InsertNO ; break;

case 2:

printf C\n Search number: \n，z):

scanf&item? key);

Search (root, item);

break;

}

case 3： /*判断是否存在该数值*/

{

printf ("'Destroy number: \n z/); scanf (，z%d，z, &item. key);

Search(root, item);

if (num==0)