Help me to show step by step solution infix to postfix - Programmers Heaven

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!


Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

Help me to show step by step solution infix to postfix

the code is running but my professor told me to modify the code. he need to see the step by step conversion of infix to postfix. the problem is i don't know how to show the step by step conversion..
(a+b )/(a-b )
a+b / a-b
a+b a-b/
ab+ ab-/

#define STACK_SIZE 100
using namespace std;

char stackChar[STACK_SIZE];
int top=-1;

void push(char c);
char pop();

int main()

char expr[STACK_SIZE], postfixexpr[STACK_SIZE];
cout << "Enter the exp<b>ression: ";


int j=0;

for(int i=0;i0");
return 0;


void push(char c)
stackChar[++top] = c;

char pop()
return stackChar[top--];
Sign In or Register to comment.