读取字符串abcdefghij，然后层次建树建立一颗二叉树，然后前序遍历输出abdhiejcfg

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

typedef char BiElemType;
typedef struct BiTNode
{
    BiElemType c;
    struct BiTNode *lchild;
    struct BiTNode *rchild;
}BiTNode,*BiTree;

//辅助队列
typedef struct tag
{
    BiTree p;//树的某一个结点的地址值
    struct tag *pnext;
}tag_t,*ptag_t;

//队列的结构体
typedef BiTree ElemType;
typedef struct LinkNode{
    ElemType data;
    struct LinkNode *next;
}LinkNode;
typedef struct LinkQueue{
    LinkNode *front,*rear;
}LinkQueue;

void PreOder(BiTree p)
{
    if(p!=NULL)
    {
        printf("%c",p->c);
        PreOder(p->lchild);//打印左子树
        PreOder(p->rchild);//打印右子树
    }
}

int main() {
    BiTree pnew;//用来指向新申请的树结点
    BiTree tree = NULL;
    char c;
    ptag_t phead = NULL, ptail = NULL, listpnew = NULL,pcur;
    //读取abcdefghij
    while (scanf("%c",&c))
    {
        if(c == '\n')
        {
            break;//读到换行就结束
        }
        //calloc申请的空间是两个参数直接相乘，并对空间进行初始化，赋值为0
        pnew = (BiTree)calloc(1,sizeof(BiTNode));
        pnew->c = c;
        //给队列结点申请空间
        listpnew = (ptag_t)calloc(1,sizeof (tag_t));
        listpnew->p = pnew;
        //如果是树的第一个结点
        if(NULL == tree)
        {
            tree = pnew;//tree指向树的根结点
            phead = listpnew;//第一个结点既是队列头，也是队列尾
            ptail = listpnew;
            pcur = listpnew;//pcur要指向：要进入树的父亲元素
        } else{
            //让元素先入队列
            ptail ->pnext = listpnew;
            ptail = listpnew;
            //接下来把b结点放入树中
            if(NULL == pcur->p->lchild)
            {
                pcur->p->lchild = pnew;//左孩子为空，就放入左孩子
            }else if(NULL == pcur->p->rchild)
            {
                pcur->p->rchild = pnew;//右孩子为空，放入右孩子
                pcur = pcur->pnext;//当前结点左右孩子都有了，pcur指向下一个
            }

        }
    }
    PreOder(tree);
    return 0;
}