Module: Stack Practice


Problem

6 /6


infix to postfix

Problem

Write a program that converts an arithmetic expression written in infix form to postfix form. 

Input
The input is a string representing the infix form of the expression (there are no spaces in the string).

Imprint
Print the postfix form of the given expression, separating each operand and operation from each other by a single space.
 
Examples
# Input Output
1 (5+3)*(7+2*4) 5 3 + 7 2 4 * + *