C++ program to evaluate an expression entered in postfix. Program to evaluate an expression entered in postfix form. C++ program to implement stack using Linked. Evaluate a postfix expression. Suppose P is an arithmetic expression in postfix notation. We will evaluate it using a stack to hold the operands.

Of the top of my head, your code is lacking in several departments: As @ChristianAichinger already pointed out, its formatting is horrible. This is a defect, since neither you nor anyone else will be able to read it. Avid Liquid 7.2 Wedding Effects here. Your else if does not open a block and therefore only operates on the next statement, which is operand2=test_stack.top(); and not the whole part that follows it. This would have been more obvious with proper formatting. There is no part in your code that parses integers.

Therefore, your code is missing a major part of its functionality. More errors may exist, but analysis is fairly hard as long the code is in such a state.

Here you will get algorithm and program for evolution of postfix expression in C. In postfix or reverse polish notation, every operator follows all of its operands. For example: 5 3 2 * + Also Read: Algorithm for Evaluation of Postfix Expression Create an empty stack and start scanning the postfix expression from left to right. • If the element is an operand, push it into the stack. • If the element is an operator O, pop twice and get A and B respectively.