关于二cha树的问题

输入一个值(假设树中每个结点的data域不同),差找从根到这个结点的路径.
代码如下:
#include <stdio.h>
#include <malloc.h>
#define maxsize 100

typedef char ElemType;
typedef struct node
{
    ElemType data;
    struct node *lchild,*rchild;
}BiNode,*BiTree;
typedef struct stack
{
    int t
    BiTree t;
}stack;


BiTree CreatBiTree()
{
    BiTree T;
    ElemType x;
    scanf("%c",&x);
    if(x!='#')
    {
        T=(BiTree)malloc(sizeof(BiNode));
        T->data=x;
        T->lchild=CreatBiTree();
        T->rchild=CreatBiTree();
    }
    return T;
}

void Way_to_root(BiTree T,ElemType x)//查找路径函数
{
    BiTree p;
    stack tree[maxsize];
    int i,k;
    i=0;
    p=T;
    while(i>0||p)
    {
        while(p)
        {
            tree[++i].t=p;
            tree[i].tag=0;
            p=p->lchild;
        }
        while(tree[i].tag==1&&i>0)
        {
            if(tree[i].t->data==x)//出栈时进行比较
            {
                for(k=1;k<=i;k++) printf("%c ",tree[k].t->data);
                return ;
            }
            i--;
        }
        if(i>0)
        {
            p=tree[i].t->rchild;
            tree[i].tag=1;
        }
    }
}

int main()
{
    BiTree T;
    ElemType x;
    T=CreatBiTree();
    scanf("%c",&x);
    Way_to_root(T,x);
    return 0;
}