按完全二叉树的层次顺序依次输入结点信息建立二叉链表的suanfa

bintnode createbintree(bintree bt) {
    bintnode* Q[100];
    bintnode* s;
    int front, rear; 
    char ch;
    ch = getchar(); bt = NULL;
    front = 1;
    rear = 0;
    while (ch != '#') {
        s = NULL;
        if (ch != '@') {
            s = (bintnode*)malloc(sizeof(bintnode));
            s->data = ch;
            s->lchild = s->rchild = NULL;
        }
        rear++;
        Q[rear] = s;
        if (rear == 1)
            bt = s;
        else {
            if (s != NULL && Q[front] != NULL)
                if (rear % 2 == 0)
                    Q[front]->lchild = s;
                else
                    Q[front]->rchild = s;
            if (rear % 2 != 0)
                front++;
        }
        ch = getchar();
    }
    return bt;
}