实验五：查找

#include<bits/stdc++.h>
#define MAXN 100
using namespace std;
typedef struct{///顺序表
    int *R,len;
}SSTable;
typedef struct BSTNode{///二叉链表
    int data;
    struct BSTNode *lchild,*rchild;
}BSTNode,*BSTree;
void menu()///菜单
{
    cout<<"\t实验5：查找\n";
    cout<<"1.建立有序表\t\t 2.折半查找\n";
    cout<<"3.建立二叉排序树\t 4.二叉排序树的删除操作\n";
    cout<<"5.输出二叉排序树\t 0.退出\n\n";
}
void CreatSeqTable(SSTable &S)///创建有序表
{
    int e;char ch;S.len=0;
    cout<<"请输入一组有序数：";
    S.R=new int[MAXN];
    cin>>S.R[++S.len];
    while((ch=getchar())!='\n')
       cin>>S.R[++S.len];
    cout<<"有序表建立成功！\n\n";
}
int Search_Bin(SSTable S,int &mid)///有序表的折半查找
{
    int key;
    cout<<"请输入需要查找的值：";
    cin>>key;
    int low=1,high=S.len;
    while(low<=high){
        mid=(low+high)>>1;
        if(key==S.R[mid])return mid;
        else if(key<S.R[mid])high=mid-1;
        else low=mid+1;
    }
    return 0;
}
void InsertBST(BSTree &T,int e)///二叉排序树的插入
{
    if(!T){
        BSTNode *S;
        S=new BSTNode;
        S->data=e;
        S->lchild=S->rchild=NULL;
        T=S;
    }
    else if(e<T->data)
        InsertBST(T->lchild,e);
    else if(e>T->data)
        InsertBST(T->rchild,e);
}
void CreatBST(BSTree &T)///二叉排序树的创建
{
    int e;char ch;
    T=NULL;
    cout<<"请输入一组数据：";
    cin>>e;InsertBST(T,e);
    while((ch=getchar())!='\n'){
        cin>>e;
        InsertBST(T,e);
    }
    cout<<"二叉排序树创建成功！\n\n";
}
void DeleteBST(BSTree &T)///二叉排序树的删除操作
{
    int e;
    cout<<"请输入需要删除的数：";
    cin>>e;
    BSTNode *p,*f,*q,*s;
    p=T;f=NULL;
    /*从根开始查找要删除的元素e的位置*/
    while(p){
        if(p->data==e)break;
        f=p;
        if(p->data>e)p=p->lchild;
        else p=p->rchild;
    }
    if(!p)return;
    /*左右子树均不空的情况*/
    q=p;
    if(p->lchild&&p->rchild){
        s=p->lchild;
        while(s->rchild){
            q=s;
            s=s->rchild;
        }
        p->data=s->data;
        if(q!=p)q->rchild=s->lchild;
        else q->lchild=s->lchild;
        delete s;
        return;
    }
    else if(!p->rchild)//无右子树的情况
        p=p->lchild;
    else if(!p->lchild)//无左子树的情况
        p=p->rchild;
    if(!f)T=p;
    else if(q==f->lchild)f->lchild=p;
    else f->rchild=p;
    delete q;
}
void OutputBST(BSTree T)///中序输出二叉排序树
{
    if(T){
        OutputBST(T->lchild);
        cout<<T->data<<' ';
        OutputBST(T->rchild);
    }
}
int main()
{
    int choose=-1,index;
    SSTable Seq;
    BSTree Tree;
    menu();
    while(choose){
        cout<<"请输入指令：";
        cin>>choose;
        switch(choose){
            case 1: CreatSeqTable(Seq);
                    break;
            case 2: if(Search_Bin(Seq,index))
                        cout<<"查找成功！该元素在有序表中位置为："<<index<<"\n\n";
                    else
                        cout<<"查找失败！有序表中无此元素！\n\n";
                    break;
            case 3: CreatBST(Tree);break;
            case 4: DeleteBST(Tree);cout<<"删除成功！\n\n";break;
            case 5: cout<<"二叉排序树输出结果：";
                    OutputBST(Tree);
                    cout<<"\n\n";break;
        }
    }
    cout<<"退出成功！\n";
    return 0;
}