二叉树的构建与遍历（C语言简实现）

    #include <stdio.h>
    #include <stdlib.h>
    #include <string.h>
    
    #define MAXSIZE 1024
    
    //二叉树节点
    typedef struct tNode{
    char data;
    tNode *lchild;
    tNode *rchild;
    }bitree;
    
    //调用函数声明
    bitree * Create();
    int LayerTraverse();
    int InOrder();
    int PreOrder();
    
    //建立二叉树
    bitree * Create(){
    char ch;
    bitree *root,*s;
    printf("Please input the char\nIf it's null input '@'\nEnd with '#'\n");
    bitree *Q[MAXSIZE];
    int front, rear;
    root = NULL; front = 1; rear = 0;
    getchar();
    while ((ch = getchar())!='#'