Question: 3. (a) Write an algorithm to convert infix to postfix expression and explain it with example (b) Write an algorithm to evaluate a postfix
3. (a) Write an algorithm to convert infix to postfix expression and explain it with example (b) Write an algorithm to evaluate a postfix expression and explain it with example
Step by Step Solution
3.39 Rating (165 Votes )
There are 3 Steps involved in it
3a Lets consider A as the infix notation and B is the postfix notation converted from A Step 1 Start Step 2 Initialize a stack and required variable S... View full answer
Get step-by-step solutions from verified subject matter experts
