what is the problems? plz help

#include #include #include #include using namespace std; // global declation int const null = -1; int const SIZE = 100; int Top = null; // Top of Stack char Q[SIZE], P[SIZE], Stack[SIZE]; // Q is infix and P is postfix expression array int n = 0; // used to count item inserted in P and index for P

void display( ) { P[n]='\0'; // this statement will put string terminator at the // end of P which is Postfix expression cout

} // closing of the convert function void Push(char item) { if(Top == SIZE-1 ){ cout

} char Pop( ) { return Stack[Top--]; }

bool IsEmpty( ) { if(Top == null ) return true; else return false; }

void get_Infix ( ) { cout

// following function will do initial work with Q and stack void step_One( ) { strcat(Q,")"); // This function add ) at the and of Q Push('('); // This statement will push first '(' on Stack }

void convert() { while(Top != null ) { for(int i=0;i

} } } // closing of the convert function }

int main() { get_Infix( ); step_One( ); convert( ); display( ); return 0;

} //END OF MAIN FUNCTION

------------------------------------------

using dev++

Put an arithematic INFIX _Expression (5 + 2) * 3 - 8 / 4 POSTFIX EXPRESION IS +*/- Process exited after 72.21 seconds with return value o Press any key to continue