二叉排序树的构造与插入

#include<stdio.h>
typedef struct BiTree{

    int key;
    struct BiTree *lchile,*rchild;

}BST,*BiTree;
//在二叉排序树上插入结点 
void BTS_Insert(BiTree &T,int k)
{
    if(T == NULL)
    {
        T = (BiTree *)malloc(sizeof(BST));
        k = T->key;
        T->lchile = T->rchild =NULL;
    }
    else
    {
        if(k == T->key)
        {
            return 0;
        }
        if(k > T->key)
        {
            BTS_Insert(T->rchild,k);
        }
        if(k < T->key)
        {
            BTS_Insert(T->lchile,k);
        }
    }
}
//构造二叉排序树
void Cre_BTS(BiTree &T,int str[])
{
    BTS *q;
    q = T;
    int i = 0;
    while(str[i]!='/0')
    BTS_Insert(q,str[i]);
    i++;
} 

int main()
{

}