Instructions:

Apply the Stack Applications algorithms in c++ without using ready stack library - make a new stack .

You have to implement the stack using the array or the linked list.

Add a screenshot of the output for the project.

1-Converting an expression from infix to postfix

opstk= the empty stack;

while (not end of input) {

symb=next input character;

if (symb is an operand) add symb to the postfix string

else {

while (!empty()&&prcd(stacktop(), symb)) {

topsym=pop();

add topsymbto the postfix string;

} /*end while*/

if (empty() II symb != )) push(symb);

else /* pop the open parenthesis and discard it */

topsymb= pop();

} /* end else*/

} /* end while*/

/*output any remaining operators*/

while (!empty()) {

topsymb=pop();

add topsymb to the postfix string;

} /* end while*/

*make sure don't use ready stack library*