中序遍历非递归算法实现

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define true 1
#define false 0
#define overFlow -2
#define MAXSIZE 100
#define OK 1
#define STACKINITSIZE 100//栈初始空间大小

typedef int Status;
//定义二叉树的结构
typedef struct BiTNode
{
   
	char data;
	struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;

//定义栈的结构
typedef struct{
   
	BiTNode *base;
	BiTNode *top;
	int stacksize;
}Sqstack;

Status InitStack(Sqstack