Please enter your email address or userHandle.
Given an infix expression in the form of a string str. Conver this infix expression to postfix expression.
The first line of input contains an integer T denoting the number of test cases. The next T lines contains an infix expression.The expression contains all characters and ^,*,/,+,-.
For each testcase, in a new line, output the infix expression to postfix expression.
1 <= T <= 100
1 <= length of str <= 103
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.