中序遍历非递归二叉树

p的"BiTree" 类型的实参与 "SElemType" 类型的形参不兼容，q怎么定义

#include
#include
#include "ConsoleApplication6.h"
using namespace std;
#define OVERFLOW -1
#define ERROR 0
#define OK 1
#define MAXSIZE 20
typedef int SElemType;
typedef int Status;
typedef int TElemType;

typedef struct BiTNode {
    TElemType data;
    struct BiTNode* lchild, * rchild;
}BiTNode,*BiTree;//定义链式二叉树

typedef struct SqStack {
    SElemType* base;
    SElemType* top;
    int stacksize;
}SqStack;//定义顺序栈

Status InitStack(SqStack& S) {
    S.base = new SElemType[MAXSIZE];
    if (!S.base) exit(OVERFLOW);
    S.top = S.base;
    S.stacksize = MAXSIZE;
    return OK;
}//建立顺序栈

Status Push(SqStack& S, SElemType e) {
    if (S.top - S.base == S.stacksize) return ERROR;
    *S.top++ = e;
    return OK;
}//入栈

Status Pop(SqStack& S, SElemType& e) {
    if (S.top == S.base) return ERROR;
    e = *--S.top;
    return OK;
}//出栈

Status StackEmpty(SqStack S) {
    if (S.top == S.base)
        return true;
    else
        return false;
}//判断栈空

void CreatBiTree(BiTree& T) {
    char ch;
    cin >> ch;
    if (ch == '#') T = NULL;
    else {
        T = new BiTNode;
        T->data = ch;
        CreatBiTree(T->lchild);
        CreatBiTree(T->rchild);
    }
}//创建二叉链表

void InOrderTraveres(BiTree T) {
    SqStack S;
    int n = InitStack(S);
    BiTree p = T;
    q = new BiTNode;
    while (p||!StackEmpty(S))
    {
        if (p) {
            Push(S, p);
            p = p->lchild;
        }
        else {
            Pop(S, q);
            cout << q->data;
            p = q->rchild;
        }
    }
}
int main() {

    return 0;
}