0
1.5kviews
Program to evaluate postfix expression using STACK ADT.
1 Answer
0
19views
  • Every character of the post-fix expression is scanned from left to right.

  • If the character encountered is an operand it is pushed onto the stack.

  • However, if an operator is encountered, then the top two values are popped from the stack and the operator is applied on these values.

  • The …

Create a free account to keep reading this post.

and 2 others joined a min ago.

Please log in to add an answer.