table evaluation of postfix expression character scanned figure stack algorithm to evaluate postfix expression let us now take an example that makes use of this algorithm consider the infix expression given as (( evaluate the expression the infix expression (( can be written as using postfix notation look at table which shows the procedure programming example write program to evaluate postfix expression #include #include #include #define max float st[max]int top=- void push(float st[]float val)float pop(float st[])float evaluatepostfixexp(char exp[])int main(float valchar exp[ ]clrscr()printf("\ enter any postfix expression ")gets(exp)val evaluatepostfixexp(exp)printf("\ value of the postfix expression "val)getch()return float evaluatepostfixexp(char exp[]int = float op op valuewhile(exp[ !'\ 'if(isdigit(exp[ ])