# include<stdio.h>
#include <string.h>
# include<malloc.h>
# define N 100
typedef struct//栈
{
char stack[N];
int top;
}SeqStack;
typedef struct Node//二叉树
{
char data[N];
struct Node *leftChild;
struct Node *rightChild;
struct Node *parent;
}BiTreeNode;
typedef struct//结点结构体
{
BiTreeNode *data[N];
int top;
}Stack;
/*--------------------------关于栈的基本操作--------------------------*/
void StackInitiate(SeqStack *S)//初始化栈,将栈底放'#'
{
S->stack[0]='#';
S->top=1;
}
int StackNotEmpty(SeqStack S)//非空否
{
if(S.top<=0) return 0;
else return 1;
}
int StackPush(SeqStack *S,char x)//入栈
{
if(S->top>=N) return 0;
else
{
S->stack[S->top]=x;
S->top++;
return 1;
}
}
int StackPop(SeqStack *S,char *d)//出栈
{
if(S->top<=0) return 0;
else
{
S->top--;
*d=S->stack[S->top];
return 1;
}
}
int StackTop(SeqStack S,char *d)//取栈顶元素
{
if(S.top<=0)
return 0;
else
