求大神帮我看看这个非递归先序遍历二叉树哪里错了 最好能帮忙修改下

Question

#include <stdio.h>
#include <stdlib.h>
#define ElemType char
typedef struct {
BiTree *base;
BiTree *top;
}stack;
//节点声明，数据域、左孩子指针、右孩子指针
typedef struct BiTNode{
char data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
void jianli(stack *s)
{
s->top=(BiTree*)malloc(sizeof(BiTree)*100);
s->base=s->top;
}
//先序建立二叉树
BiTree CreateBiTree(){
char ch;
BiTree T;
scanf("%c",&ch);
if(ch=='#')T=0;
else{
T = (BiTNode *)malloc(sizeof(BiTNode));
T->data = ch;
T->lchild = CreateBiTree();
T->rchild = CreateBiTree();
}
return T;//返回根节点
}
void push(stack *s,BiTree T)
{
*s->top++=T;
}
BiTree pop(stack *s){
BiTree U;
s->top--;
U=*s->top;
return U;
}
void feidigui(BiTree T)
{
stack s;
jianli(&s);
if (T){
while (T)
{printf("%c",T->data);
if (T->lchild) {push(s,T);
T=T->lchild;}
else if (T->rchild) T=T->rchild;
else if ((s->top)-(s->base)) T=pop(s);
else T=0;
}
}}
void main(){
BiTree T;
T = CreateBiTree();//建立
feidigui(T);
}

Answer 1

BiTree* CreateBiTree(){
char ch;
BiTree* T;

其他的BiTree T 都改成BiTree* T

追问

编译不过。。