Lab Work $8$: Queue Exercises using STL Queue

Task $1$: Using the provided queue example code, debug and see how add, delete, and search operations are done

with the STL queue in C$++.$

Task $2$: Redesign your postfix to infix algorithm to utilize queues instead of string parameters. Here is some

explanation of why queues are a better choice for that task.

Brief Explanation of queues over string parameters:

String Tokenization: When processing expressions as strings, you need to tokenize the string to separate

operands and operators. This involves parsing the string character by character, which can be complex

and error$-$prone, especially when dealing with multi$-$digit numbers or operators with multiple characters.

Using a queue simplifies this process because you can directly enqueue operands and operators as

individual tokens. This ensures more efficient and accurate tokenization without the need for manual

parsing.

Order Preservation: In postfix expressions, the order of operands and operators is crucial for determining

the correct evaluation order. By using a queue, you can enqueue operands and operators in the order

they appear in the postfix expression. This preserves the original order and ensures the correct

expression structure is maintained during conversion.

Better Results: Using queues allows for a more structured and organized approach to expression

conversion. As operands and operators are enqueued sequentially, the conversion algorithm can traverse

the queue in a systematic manner, processing each token in the correct order. This results in cleaner and

more predictable code, leading to better overall results in terms of readability, efficiency, and

correctness. PLEASE WR$$TE THE CODE FOR TASK $2$