二叉树的创建与使用

typedef struct BiNode  
{  
     int data;  
     struct BiNode *lchild;  
     struct BiNode *rchild;  
}BiNode;  
  
BiNode* Insert(BiNode* T, int data)  
{  
     if(NULL == T)  
     {  
         T = (BiNode*)malloc(sizeof(BiNode));  
         T->data = data;  
         T->lchild = NULL;  
         T->rchild = NULL;  
         return T;  
     }  
    if(data <= T->data)  
        T->lchild = Insert(T->lchild, data);  
    else  
        T->rchild = Insert(T->rchild, data);  
    return T;  
}  
//创建一个二叉排序树, input -1 to end  
BiNode* createBiSortTree()  
{  
     BiNode *root = NULL;  
     int data;  
     while(1)  
     {  
         scanf("%d",&data);  
         if(-1 == data)  
             break;  
         root = Insert(root, data);  
     }  
     return root;  
}