数据结构 实验6各种查找操作

q->rchild = p->rchild ;
if (par->lchild==p) par->lchild=p->lchild ;
if (par->rchild==p) par->rchild = p->lchild ;
}
midorder(NODE *root)
{ if(root!=NULL)
else if(par->val>q->val) par->lchild= q ; /*insert in the left subtree of par's*/
else par->rchild=q ; /*insert in the right subtree of par's*/
midorder(root);}
else printf("Insert Failed!\n");
break;
case 3:
printf("This is Delete!\n");
printf("Please input the value you want to delete!\n");
break;
case 2:
printf("This is insert!\n");
printf("Please input the value you want to insert:");
scanf("%d",&val);
if(insert(root,val)!=0) {printf("Insert Success!\n");
{
NODE *p,*q,*par;
int mark= 0 ;
p=root ;
par=NULL ;
while (p!=NULL&& mark==0 )
{ pal==value) mark= 1;
else if(p->val>value)p=p->lchild;/*it should be inserted in the left subtree*/
else if(p->val<value)p =p->rchild ;/*it should be inserted in the right subtree*/
}
if ( mark==1) return 0; /*if it exists,do not insert*/
{ if(par->val>p->val) par=par->lchild;
else par=par->rchild;
}
if(p->lchild ==p->rchild ==NULL)
if(par->lchild==p) par->lchild=NULL;
printf("This is ErFen Search!\n");
result=erfen(a,n,k);
if(result>=0)
printf("In the No. %d of the array\n",result+1);
else
else if(key<array[mid])
r=mid-1;
else l=mid+1;
}
return -1;
}
程序2：查找树的实现和运算
#include "stdio.h"
#include "alloc.h"
{NODE *p ;
if(root==NULL) return NULL ; /*if the tree is empty,return null*/
p=root ;
while (p)
{ if (p->val==key) return p;
if(p->val>key) p=p->lchild;
q=(NODE*)malloc(sizeof(NODE));/*create a new node whose value is the given key*/
q->val= value ;
q->lchild= q-> rchild =NULL ;
if (root==NULL) root= q ; /*if original tree is empty,then q is the root*/
return 1;
}
int delete(NODE *root,int value)
{ NODE *p,*par,*q;
p=search(root,value);
if(p==NULL) return(NULL);
par=root;
while(par->lchild!=p&&par->rchild!=p)
{ int l, r,mid;
l=0;
r=n-1;
while (l<=r)
{mid=(l+r)/2;
if(key==array[mid])
return mid; /*it is found,return its address*/
if(result>=0)
printf("Found No.%d elements of the array\n",result+1);
else
printf("Not found\n");
break;
case 2:
printf("Not found\n");
break;
default:
printf("1-------------------------ShunXu Search\n");
printf("2-------------------------ErFen Search\n");
实验六、各种查找操作
程序1：线性表查找实现和运算
#define MAX 128
main()
{ int i,k,m,n,result;
int a[MAX];
printf("How many nodes in the array \n");
scanf("%d",&n);
else par->rchild=NULL;
if (p->lchild==NULL)
if(par->lchild==p) par->lchild=p->rchild;
else par->rchild=p->rchild;
else if (p->rchild==NULL)
return;
}
}
int shx (array, n, k)
/*find the subscript of an element's which value is k in array[n]*/
int array[], n, k;
{ int i;
array[n]=k;/*watch*/
}
midorder(root);
printf("\n");
printf("Please input your choice(1-3):");
scanf("%d",&k);
switch(k)
{ case 1:
printf("This is search!\n");
printf("Please Input Your Choice(1-2):");
scanf("%d",&m);
switch(m)
{ case 1:
printf("This is ShunXu Search!\n");
result=shx(a,n,k);
#define MAX 100
struct node{
int val;
struct node *lchild,*rchild;
};
typedef struct node NODE;
NODE *search(NODE* root,int key)
/*find the node whose value is key in the tree and then return the node's pointer */
printf("How many nodes?\n");
scanf("%d",&n);
if(n<1) return;
root=(NODE *)malloc(sizeof(NODE));
printf("Please input the nodes:\n");
else p=p->rchild;
}
return p; /*if it is not found,return null*/
}
int insert(NODE *root,int value)
/*insert a node whose value is value in the tree*/