I need a complete working code for a solution to this problem using visual studio 2015: C++ Programming (7th Edition) Chapter 17, Problem 10PE Solution Ans: #include using namespace std; class InfixToPostfix { private:char *p;//for infix expression char *q;//for postfix expression char *stack; //stack array int top; //top public: InfixToPostfix();//constructor void getInfix();//ro read infix expression void showInfix();//to display infix expression void showPostfix();//to display postfix expression void push(char ele);//to push elements into the stack char pop();//to pop elements from stack void convertToPostfix();//to convert infix to postfix int precedence(char);//to find precedence of an operator ~InfixToPostfix();//destructor }; InfixToPostfix::InfixToPostfix(void) { top=-1; p=new char[100]; q=new char[100]; stack=new char[10]; } void InfixToPostfix::getInfix(){ cout<<\"enter infix expression:\"; cin>>p; } void InfixToPostfix::showInfix(){ cout<<\"\ Given Infix Expression: \"<=precedence(*(p+i)) && top!=-1) { ch=pop(); q[j]=ch;j++; }//end of while push(*(p+i));//push next symbol into the stack } //end of else }//end of for loop while(top!=-1) { ch=pop(); q[j]=ch;j++; } q[j]=\'\\0\'; }//end of convertToPostfix() void InfixToPostfix::showPostfix() //to display postfix expression { cout<<\"Postfix Expression: \"<.

1. I need a complete working code for a solution to this problem using visual studio 2015:
C++ Programming (7th Edition)
Chapter 17, Problem 10PE
Solution
Ans:
#include
using namespace std;
class InfixToPostfix
{
private:char *p;//for infix expression
char *q;//for postfix expression
char *stack; //stack array
int top; //top
public: InfixToPostfix();//constructor
void getInfix();//ro read infix expression
void showInfix();//to display infix expression
void showPostfix();//to display postfix expression
void push(char ele);//to push elements into the stack
char pop();//to pop elements from stack
void convertToPostfix();//to convert infix to postfix
int precedence(char);//to find precedence of an operator
~InfixToPostfix();//destructor
};
InfixToPostfix::InfixToPostfix(void)
{
top=-1;
p=new char[100];
q=new char[100];
stack=new char[10];
}
void InfixToPostfix::getInfix(){
cout<<"enter infix expression:";

2. cin>>p;
}
void InfixToPostfix::showInfix(){
cout<<" Given Infix Expression: "<=precedence(*(p+i)) && top!=-1)
{
ch=pop();
q[j]=ch;j++;
}//end of while
push(*(p+i));//push next symbol into the stack
} //end of else
}//end of for loop
while(top!=-1)
{
ch=pop();
q[j]=ch;j++;
}
q[j]='0';
}//end of convertToPostfix()
void InfixToPostfix::showPostfix() //to display postfix expression
{
cout<<"Postfix Expression: "<