data structures using printf("\ incorrect element in expression")exit( )while((top!=- &(st[top]!='(')target[jpop(st) ++target[ ]='\ 'int getpriority(char opif(op=='/|op ='*|op=='%'return else if(op=='+|op=='-'return void push(char st[]char valif(top==max- printf("\ stack overflow")else top++st[top]=valchar pop(char st[]char val='if(top==- printf("\ stack underflow")else val=st[top]top--return valoutput enter any infix expression + - * the corresponding postfix expression is ab+cd*evaluation of postfix expression the ease of evaluation acts as the driving force for computers to translate an infix notation into postfix notation that isgiven an algebraic expression written in infix notationthe computer first converts the expression into the equivalent postfix notation and then evaluates the postfix expression both these tasks--converting the infix notation into postfix notation and evaluating the postfix expression--make extensive use of stacks as the primary tool using stacksany postfix expression can be evaluated very easily every character of the postfix expression is scanned from left to right if the character encountered is an operandit is pushed on to the stack howeverif an operator is encounteredthen the top two values are popped from the stack and the operator is applied on these values the result is then pushed on to the stack let us look at fig which shows the algorithm to evaluate postfix expression