关于动态创建二叉树问题

#include <stdlib.h>
#include <stdio.h>

struct BiTNode
{
    int data;
    struct BiTNode * lchild,* rchild;
};

struct BiTree
{
    //树的根结点
    BiTNode* pRoot;
};


void CreateBiTree(BiTree *t);
void PreTraverseBTree(BiTNode *pCurNode);

/*
void CreateBiTree(BiTree *t)
{
    int temp;
    scanf("%d",&temp);
    if(temp)     //我们假定输入的结点值不能为0，即0表示空
    {//如果temp非零的话，我们为其分配储存空间
        (*t)=(BiTree)malloc(sizeof(BiTNode));
        if(!(*t))//若分配失败！
        {
            exit(-1);
        }
        (*t)->data=temp;
        CreateBiTree(&((*t)->lchild));  //递归创建左子树
        CreateBiTree(&((*t)->rchild));  //递归创建右子树
    }
    else
        (*t)=NULL;
}
*/

void InitTree(BiTree *t)
{
    t->pRoot = NULL;
}

void CreateBiTree(BiTree *t)
{
    int temp = 0;
    BiTNode* pNewNode = NULL;
    BiTNode* pCurNode = NULL;

    while(true)
    {
        scanf("%d",&temp);


        if(temp == 0)
        {
            return;
        }
      
        //新结点
        pNewNode = (BiTNode*)malloc(sizeof(BiTNode));
        pNewNode->data = temp;
      
        //根节点为NULL
        if(t->pRoot == NULL)
        {
            t->pRoot = pNewNode;
            t->pRoot->lchild = t->pRoot->rchild = NULL;
            continue;
        }

        pCurNode = t->pRoot;

        //temp >= 当前数据 添加在右边
        if(temp >= pCurNode->data)
        {
            while(pCurNode)
            {
                if(pCurNode->rchild != NULL)
                {
                    pCurNode = pCurNode->rchild;
                }
                else
                {
                    pCurNode->rchild = pNewNode;
                    pCurNode->rchild->lchild = pCurNode->rchild->rchild = NULL;
                    break;
                }
            }
        }
        else
        {
            //temp < 当前数据 添加在左边
            while(pCurNode)
            {
                if(pCurNode->lchild != NULL)
                {
                    pCurNode = pCurNode->lchild;
                }
                else
                {
                    pCurNode->lchild = pNewNode;
                    pCurNode->lchild->lchild = pCurNode->lchild->rchild = NULL;
                    break;
                }                       
            }
        }
    }
}

void PreTraverseBTree(BiTree * Tree)
{
    PreTraverseBTree(Tree->pRoot);
}

void PreTraverseBTree(BiTNode *pCurNode)//先序遍历函数
{
    if (pCurNode == NULL)
    {
        return;
    }

    printf("%d\r\n", pCurNode->data);
    PreTraverseBTree(pCurNode->lchild);
    PreTraverseBTree(pCurNode->rchild);
    /*
    if(NULL != t)
    {
        printf("%c\n",(*t)->data);

        if(NULL!= ((*t)->lchild))
        {
            PreTraverseBTree(&((*t)->lchild));
        }
        if(NULL != ((*t)->rchild))
        {
            PreTraverseBTree(&((*t)->rchild));
        }
    }*/
}

int main(void)
{
    BiTree MyTree;

    InitTree(&MyTree);

    CreateBiTree(&MyTree);

    PreTraverseBTree(&MyTree);

    return 0;
}