JAVA/ Data structure

Convert Infix to Postfix Using Stack

For this assignment you can use the built-in stack library for your language:

Java:

import java.util.Stack;

Assume numbers are integers and standard operations are +, - , *, /, ( ) and exponents.

2+3*4	234*+
a*b+5	ab*5+
(1+2)*7	12+7*
a*b/c	ab*c/
(a/(b-c+d))*(e-a)*c	abc-d+/ea-*c*
a/b-c+d*e-a*c	ab/c-de*+ac*+-

...

Stack postfixStack = new Stack();

postfixStack.push("A");

String item = postfixStack.pop();