中序表达式转换成后序表达式

printf("%c pop from the stack\n",operand1);
postorder[j++]=operand1;
printf("print %c\n",operand1);
}
}
else
{
if(priority(string[i])<=priority(operand->num))
int is_operator(char ch);
int two_result(int oper,int operand1,int operand2 );
int priority(char ch);
int i=0;
int j=0;
//----------------------------------------------------------------------------------------
p->next=NULL;
if(p==NULL)
{
printf("memory allocation failure!!!\n");
exit(0);
}
/*if(p==NULL)
{
printf("memory allocation failure!!!\n");
printf("print %c\n",string[i]);
}
i++;
}
while(!empty(operand))
{
operand=pop(&operand1,operand);
printf("%c pop from the stack\n",operand1);
link operand=NULL; //操作数堆栈
//****************
//函数声明
//****************
link push(int data,link top);
link pop(int *value,link top);
int empty(link Operator);
postorder[j++]=operand1;
} printf("print %c\n",operand1);
postorder[j]='\0';
printf("the postorder expression is:");
for(k=0;k<MAX;k++)
{
//主程序
//----------------------------------------------------------------------------------------
int main()
{
char string[MAX];
char postorder[MAX];
default: return 0;
}
}
//----------------------------------------------------------------------------------------
//计算两个操作数的值
//----------------------------------------------------------------------------------------
int two_result(int oper,int operand1,int operand2 )
{
switch(oper)
{
case '+': return (operand2+operand1);
case '-': return (operand2-operand1);
{
operand=pop(&operand1,operand);
printf("%c pop from the stack\n",operand1);
postorder[j++]=operand1;
printf("print %c\n",operand1);
{
if(is_operator(string[i])) //判断是否位运算符
{
if(empty(operand)||string[i]=='(')
{
operand=push(string[i],operand);
int priority(char ch)
{
switch(ch)
{
case '+':
case '-':
return 1;
case '*':
case '/':
return 2;
#include<stdio.h>
#include<stdlib.h>
#define MAX 20
struct list
{
int num;
struct list *next;
};
typedef struct list NODE;
typedef NODE *link;
//----------------------------------------------------------------------------------------
link pop(int *value,link top)
{
link p;
p=NULL;
if(top!=NULL)
//判断运算符堆栈是否为空
//----------------------------------------------------------------------------------------
int empty(link Operator)
{
if(Operator==NULL)
}
operand=push(string[i],operand);
printf("%c push the stack\n",string[i]);
}
}
}
else
{
postorder[j++]=string[i]; //if it's an operand then print it
}*/
p->num=data;
p->next=top;
top=p;
return top;
}
//----------------------------------------------------------------------------------------
//从堆栈中取出数据
int operand1=0;
int k;
//for(;i<MAX;i++)
//postorder[i]=32;
printf("please input inorder expression=>");
gets(string);
while(string[i]!='\0'&&string[i]!='\n')
case '*': return (operand2*operand1);
case '/': return (operand2/operand1);
}
return 0;
}
return 1;
else
return 0;
}
//----------------------------------------------------------------------------------------
//判断是否是运算符
//----------------------------------------------------------------------------------------
//=============================program description=======================================
//程序名称：1.c
//程序目的:将中序表达式转换成后序表达式
//written by Lin
//=======================================================================================
printf("%c push the stack\n",string[i]);
}
else
{
if(string[i]==')')
{
while(operand->num!='(')
{
operand=pop(&operand1,operand);
int is_operator(char ch)
{