Multiple choice Which data structure is needed to convert infix notations to postfix notations? Linear list Queue Tree Stack Reveal answer Fill a bubble to check yourself D Correct answer Explanation The Shunting-yard algorithm, which converts infix to postfix, uses a stack to hold operators until they can be placed in the output string.