二叉树求表达式 - 副本.docVIP

二叉树求表达式 - 副本 #includestdio.h #includemalloc.h #includestring.h #includestdlib.h #define maxsize 40 #define OPSETSIZE 7 char opset[ OPSETSIZE]={+,-,*,/,(,),#}; char prior[ OPSETSIZE][ OPSETSIZE] = { ,,,,,,, ,,,,,,, ,,,,,,, ,,,,,,, ,,,,,=, , ,,,, ,,, ,,,,, ,= }; /* 算符间的优先关系*/ typedef char ElemType; typedef struct { ElemType data[maxsize]; int top; }Stackchar; typedef struct node { ElemType data; struct node *lchild,*rchild; }Bitree; typedef struct { Bitree *data[maxsize]; int top; }StackNum; StackNum *OPND; Stackchar *OPTR; Bitree *bt=NULL; void InitStack1(StackNum *p) { p-top=-1; } void InitStack2(Stackchar *p) { p-top=-1; } void Push_num(StackNum *p,Bitree *x) { if(p-top==maxsize-1)printf(overflow); else { p-top++; p-data[p-top]=x; } } void Push_char(Stackchar *p,ElemType x) { if(p-top==maxsize-1)printf(overflow); else { p-top++; p-data[p-top]=x; } } Bitree *Pop_num(StackNum *p) { if(p-top==-1){printf(the stack is empty1\n); return 0;} else { p-top--; return p-data[p-top+1]; } } ElemType Pop_char(Stackchar *p) { if(p-top==-1){printf(the stack is empty2\n); return 0;} else { p-top--; return p-data[p-top+1]; } } ElemType GetTop2(Stackchar *p) { if(p-top==-1) { printf(the stack is empty3\n); return 0; } else return(p-data[p-top]); } int num(int n) { char str[50]; itoa(n,str,10); n=strlen(str); return n; } int In(char Test) { int Find=0,i; for(i=0;iOPSETSIZE;i++) if (Test ==opset [i]) Find=1; return Find; }//判断是否为运算符 int ReturnOpOrd(char n) { int i; char *p=opset; for(i=0;iOPSETSIZE;i++) if(n==*(p+i))return i; return 0; } int Operate(int a,char ch,int b) { switch(ch) { case+:return a+b; case-:return a-b; case*:return a*b; case/:return a/b; default: return 0; } } void CrtNode(char c) { Bitree *T=NULL; T=(Bitree *)malloc(sizeof(Bitree)); T-data=c; T-lchild=NULL; T-rchild=NULL; Push_num(OPND,T); } void Crtsubtree(char c) { Bitree *T=NULL; T=(Bitree