void Delete(BiTree &p)
      {
      BiTree q,s;
        if(!p->rchild)
        {
            q=p;
            p=p->lchild;
            free(q);
        }
        else if(!p->lchild)
        {
            q=p;
            p=p->rchild;
            free(q);
        }
        else
        {
            q=p;
            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;
            free(s);
        }
    }

 
 void DeleteBSTree(BiTree &T,keyType key)
 {
    BiTree p;

    if(p=SearchBSTree(T,key))
        Delete(p);
  }


各位大哥大姐，这是小弟写的二叉排序树的删除算法，
但是删除不了，劳烦各位指点一下，小弟在这多谢了