#include<stdio.h>
#include<stdlib.h>
#include<iostream>
using namespace std;
typedef struct BiTree
{
char data;
struct BiTree *Lchild;
struct BiTree *Rchild;
}BiTree, *Binary_Tree;
#define MAXN 100
//定义栈,类型int
typedef struct node {
int data[MAXN];
int top;
}node, *pointer;
//入栈
int Push(node* ss, int* x)
{
if (ss->top<MAXN)
{
ss->top++;
ss->data[ss->top] = *x;
return 1;
}
else
{
cout << "error" << endl;
return 0;
}
}
//出栈
int Pop(node *ss, int *x)
{
if (ss->top == -1)
{
cout << "栈空" << endl;
return 0;
}
else
{
*x = ss->data[ss->top];
ss->top--;
return 1;
}
}
int eval(char op, int x, int y)
{
switch (op)
{
case '+':
return x + y;
case '-':
return x - y;
case '*':
