Question: In the infix to postfix conversion, we normally would use a Stack to store the operator (e.g. + - * /). Explain the main reason
In the infix to postfix conversion, we normally would use a Stack to store the operator (e.g. + - * /). Explain the main reason behind the idea of using Stack data structure. We want to replace Stack with ArrayList to store the operator. Explain the possibilities in using ArrayList and provide solution to solve the Last in First Out problem in ArrayList.
Step by Step Solution
There are 3 Steps involved in it
The main reason for using a Stack data structure in infix to postfix conversion is because of its Last In First Out LIFO behavior In this process as o... View full answer
Get step-by-step solutions from verified subject matter experts
