二叉排序树 BST

#include<stdio.h>  /// Binary Tearch Tree  book
#include<stdlib.h>

#define EQ(a,b) (a==b)
#define LT(a,b) (a<b)
#define LQ(a,b) (a<=b)
typedef int KeyType ;
typedef int Status;
#define TRUE 1
#define FALSE 0

typedef struct BiTNode{
	KeyType key;
	struct BiTNode *lchild,*rchild;
}*BiTree;
BiTree q,p,s;

///===add===///
BiTree Search(BiTree T,KeyType key)
{
    if(!T||EQ(key,T->key)) return T;
    else if LT(key,T->key) return Search(T->lchild,key);
    else return Search(T->rchild,key);
}
///add
Status searchBST(BiTree T,KeyType key,BiTree f,BiTree &p)  /// f is the father of T  查找 f是父节点 p存最后的父节点 即 f
{
    if(!T) {p=f;return FALSE;}
    else if EQ(key,T->key) {p=T;return TRUE;}   /// p=T is usefull ??
    else if LT(key,T->key) return searchBST(T->lchild,key,T,p);
    else return searchBST(T->rchild,key,T,p);
}

Status InsertBST(BiTree &T,KeyType e)  /// 插入
{
    if(!searchBST(T,e,NULL,p)){
        s=(BiTree)malloc(sizeof(BiTNode));
        s->key=e;
        s->lchild=s->rchild=NULL;

        if(!p) T=s;   /// s is root node  // s是根节点
        else if LT(e,p->key) p->lchild=s;
        else p->rchild=s;
        return TRUE;
    }
    else return FALSE;
}

Status Delete(BiTree &T)
{
    if(!T->rchild){
        q=T;T=T->lchild;free(q);
    }
    else if(!p->lchild){
        q=T;T=T->rchild;free(q);
    }
    else{
        s=T;
        q=T->lchild;
        while(!q->rchild){s=q;q=q->rchild;}

        if(s!=T) s->rchild=q->lchild;  /// s isn't node T
        else s->lchild=q->lchild;
        /// way 0
        s=T;
        q->lchild=T->lchild;
        q->rchild=T->rchild;
        T=q;
        free(s);

//        /// way 1   Book
//        T->key=q->key;
//        free(q);
    }
    return TRUE;
}

Status DeleteBST(BiTree &T,KeyType key)
{
    if(!T) return FALSE;
    else{
        if EQ(key,T->key) return Delete(T);
        else if LT(key,T->key) return DeleteBST(T->lchild,key);
        else  return DeleteBST(T->rchild,key);
    }
}

void output(BiTree  T)
{
    if(!T) return ;
    output(T->lchild);
    printf("%d ",T->key);
    output(T->rchild);
}

int main()
{
    BiTree T=NULL;
    int a[10]={3,8,6,3,5,1,0};
    for(int i=0;i<7;i++)
        InsertBST(T,a[i]);
    output(T);
    puts("");
    return 0;
}