Which data structure is used for converting infix notation to postfix notation?
2025
Which data structure is used for converting infix notation to postfix notation?
Answer: A. Stack — The conversion from infix to postfix notation is typically performed using a stack data structure. The stack helps manage operator precedence and parentheses…
- A.
Stack
- B.
Queue
- C.
Branch
- D.
Tree
Attempted by 1197 students.
Show answer & explanation
Correct answer: A
The conversion from infix to postfix notation is typically performed using a stack data structure. The stack helps manage operator precedence and parentheses during the evaluation process, ensuring that operators are output in the correct order relative to their operands.
Loading lesson…