Multiple choice

Which among the following algorithms requires the reverse of input string before processing through stacks?

  1. Infix to postfix conversion

  2. Infix to prefix conversion

  3. Postfix evaluation

  4. Prefix evaluation
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

To convert an infix expression to a prefix expression, the standard algorithm involves reversing the infix string, converting it to postfix, and then reversing the result.

Keep practicing — related questions