Question: Develop a program using Python that uses recursion to convert a prefix expression containing single letter operands and the operators +, -, *, /, and
Develop a program using Python that uses recursion to convert a prefix expression containing single letter operands and the operators +, -, *, /, and $ (representing exponentiation) to postfix expression. The output of the program is the corresponding postfix expression. If your input is *AB then output should be AB*. Output of BA* is considered incorrect. No library functions.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
