My goal is to implement a C++ program that converts an infix expression into a postfix expression and then evaluates the postfix expression. I am using the Stack and Queue classes I developed with a List class (linked list) that manages the data in the stack and queue.
The output will be: Print out the infix expression, the postfix expression, and the calculated results of the expression.
I have to be able to handle the ( ) + - * / and ^ (exponential/power) operators. The precedence of ^ operator is higher than that of * and / operators.
I have attached the algorithm I am using to do this as well as the input to read in and use.
Read in the data 1 token at a time and deal with it then, do not read anything in as a string.
This must be implemented within my program and must use the stack and queue and general list I already have.
Attachment:- infix.zip