ONP  Transform the Expression
Transform the algebraic expression with brackets into RPN form (Reverse Polish Notation). Twoargument operators: +, , *, /, ^ (priority from the lowest to the highest), brackets ( ). Operands: only letters: a,b,...,z. Assume that there is only one RPN form (no expressions like a*b*c).
Input
t [the number of expressions <= 100] expression [length <= 400] [other expressions]
Text grouped in [ ] does not appear in the input file.
Output
The expressions in RPN form, one per line.
Example
Input: 3 (a+(b*c)) ((a+b)*(z+x)) ((a+t)*((b+(a+c))^(c+d))) Output: abc*+ ab+zx+* at+bac++cd+^*
hide comments
theslowcoder:
20200120 16:44:04
Solved it using binary expression tree. Class Tree that has pointers to the left and right subtrees and two functions one fills the tree from the input string and the second one reads it in postfix traversal. 

pprathamesh:
20200114 07:52:29
Easy just think on paper then code one by one 

kartikeya18c:
20200106 17:32:16
AC in one go :) 

dharan1011:
20200105 08:42:31
The problem is intresting and good. But the question could have be more clear. 

truong62:
20200101 16:13:14
how to submit correct format input ?


ag2byte:
20191201 20:40:51
my code runs perfectly on my pc. but its showing WA here. What to do? 

alone_musk:
20191201 08:10:15
In this case (a+(b+d)^k) is it abd+k^+ ? . Please correct me if I'm wrong 

perl_add_add:
20190927 08:44:36
I am Chinese who is interested in SPOJ and Poland. 

gautam97:
20190916 17:18:54
i am getting SIGABRT averytime


neerajamoniya:
20190803 08:05:56
It's very easy. No recursion or stacks and queue required. 
Added by:  mima 
Date:  20040501 
Time limit:  5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 VB.NET 
Resource:   