7081 二叉排序树的创建，查找，删除

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef struct bstnode{
int data;
struct bstnode *lchild,*rchild;

}bstnode,*bstree;
int searchbst(bstree mytree,int key){
    if(mytree==NULL) return 0;
    if(key==mytree->data) return 1;
     if(key<mytree->data) return searchbst(mytree->lchild,key);
     if(key>mytree->data) return  searchbst(mytree->rchild,key);
}
void insertbst(bstree &mytree,int x){
if(mytree==NULL){
      mytree=new bstnode;
     mytree->data=x;
     mytree->lchild=NULL;
     mytree->rchild=NULL;
}else if(x<mytree->data){
insertbst(mytree->lchild,x);
}else if(x>mytree->data){
    insertbst(mytree->rchild,x);
}
}
void creatbst(bstree &mytree){

     mytree=NULL;
     int x;
     cin>>x;
     while(x!=0){
        insertbst(mytree,x);
        cin>>x;
     }
}
void visit(bstree mytree){
if(mytree){
    visit(mytree->lchild);
    cout<<mytree->data<<" ";
    visit(mytree->rchild);
}
}

void delet(bstree &mytree,int key){
    bstree p,f,s,q;
    p=mytree;f=NULL;
    if(!p) {cout<<"kongshu"<<endl;exit(0);}
    while(p){
         if(p->data==key) break;
         f=p;
        if(p->data<key) p=p->rchild;
         else p=p->lchild;
    }
    if(!p){cout<<"wu node"<<endl;exit(0);}
    q=p;
    if(p->lchild&&p->rchild){
            s=q->lchild;
        while(s->rchild!=NULL){
            q=s;
            s=s->rchild;
        }
        p->data=s->data;

       if(q!=p)q->rchild=s->lchild;
       else p->lchild=s->lchild;
       free(s);
       return;

    }else if(!p->lchild){
        p=p->rchild;

    }else if(!p->rchild){
        p=p->lchild;
    }
    if(f->lchild==q) f->lchild=p;
    else f->rchild=p;
    free(q);
}
int main()
{
    int x;
   bstree mytree;
    creatbst(mytree);
    visit(mytree);
    cout<<endl;
    cin>>x;
    x=searchbst(mytree,x);
    if(x==1) cout<<"该数存在"<<endl;
    else cout<<"该数不存在"<<endl;
    cin>>x;
    delet(mytree,x);
    visit(mytree);
    cout<<endl;


    return 0;
}
//53 78 65 87 17 45 09 23 0 45