//Convert an infix expression to postfix expression...

#include<iostream>
#include<string>
#include<cstdlib>
using namespace std;
char ifx[50],pfx[50],stk[50];
int top=-1,n;
char push(char ch)
{
    if(top!=n)
    {
        ch=stk[top];
        top++;
        return ch;
    }
    else
        cout<<"\nThe stack is full.";    
}
void pop()
{
    char rmv;
    if(top!=-1)
    {
        rmv=stk[top];
        top--;
        cout<<"\nElement removed was "<<rmv;
    }
    else
        cout<<"\nThe stack is empty.";
}
char topele()
{
    char t;
    if(top==-1)
        t='#';
    else
        t=stk[top];
    return t;
}
int chkpres()
{
    char ch;
    switch(ch)
    {
        case '^': return 5;
            break;
        case '*': return 4;
            break;
        case '/': return 3;
            break;
        case '+': return 2;
            break;
        case '-': return 1;
            break;
        default: exit(1);
            break;
    }
}
int main()
{
    char pre,pres,ele,elem,chk,popp,topp;
    cout<<"\nEnter how many elements you want to enter in the infix expression: ";
    cin>>n;
    topp=stk[top];
    cout<<"\nEnter the characters of the infix expression one by one: ";
    for(int i=0;i<n;++i)
    {
        cin>>ifx[i];
        //for(int i=0;ifx[i]='\0';++i)
        //{
            if(ifx[i]!='^' && ifx[i]!='*' && ifx[i]!='/' && ifx[i]!='+' && ifx[i]!='-')
                pfx[i]=ifx[i];
            else if(ele=='(')
            {
                ele=ifx[i];
                push(ele);
                top++;
            }
            else if(ifx[i]=='^'||ifx[i]=='*'||ifx[i]=='/'||ifx[i]=='+'||ifx[i]=='-')
            {
                if(topp=='^'||topp=='*'||topp=='/'||topp=='+'||topp=='-')
                {
                    pre=ele;
                    pres=topp;
                    chk=chkpres();
                    if(pre>pres)
                    {
                        topp=pre;
                        top++;
                    }
                    else if(pres>=pre)
                        pfx[i]=pres;
                }    
            }
            else if(ele=')')
            {
                while(topp!='#')
                {
                    popp=topp;
                    pfx[i]=popp;
                }
            }
       // }
    }
    cout<<"\nThe postfix expression is: ";
    for(int i=0;pfx[i]!='\0';++i)
    {
        cout<<pfx[i];
    }
return 0;
}

Enter how many elements you want to enter in the infix expression: 9

Enter the characters of the infix expression one by one: a
*
(
b
+
c
)
/
d

The postfix expression is: a