//作只有加减乘除运算的表达式求值 Node *Compute(Node *p) { int mark=0; Node *m,*n; char max_char,min_char; m=n=p; while(p->next->c!='#') { max_char=n->next->c; n=n->next->next; min_char=n->next->c; if((Precede(max_char,min_char)=='<'||Precede(max_char,min_...