do not use any auxiliary data structures (in particular, do not
use a stack).
Write a recursive method, eval, to evaluate a postfix expression. The expression
is represented as a String and contains the following operators: +, -, * and /.
For simplicity, assume that all the numbers are single digit and unsigned, for
instance 5, or 6 but not 23, 124 or -4. An example of an input is: ”873-*4+23-
Write a recursive method, infix, to transform a postfix expression into an infix
one. Use the same assumptions as in the previous question. For simplicity, put
all operation between parentheses. For instance, the postfix expression ”23+”
is transformed to ”(2+3)”, and ”873-*4+23-*58-+” is transformed to ”((((8*(7-
18 freelancers are bidding on average $29 for this job
Feel fee to contact me [url removed, login to view] me message to discuss further more details .We provide the comments,images,videos,demos and live sessions in order to help the [url removed, login to view] payment only after the work done. You ca Mere
Hello there, I am a core java developer with an experience of 3 years. I can do this project for you. Will be glad to get an opportunity to work for you. Waiting for your positive reply. Regards!