data structures using push(st(float)(exp[ ]-' '))else op pop(st)op pop(st)switch(exp[ ]case '+'value op op breakcase '-'value op op breakcase '/'value op op breakcase '*'value op op breakcase '%'value (int)op (int)op breakpush(stvalue) ++return(pop(st))void push(float st[]float valif(top==max- printf("\ stack overflow")else top++st[top]=valfloat pop(float st[]float val=- if(top==- printf("\ stack underflow")else val=st[top]top--return valoutput enter any postfix expression value of the postfix expression conversion of an infix expression into prefix expression there are two algorithms to convert an infix expression into its equivalent prefix expression the first algorithm is given in fig while the second algorithm is shown in fig