Algorithmic sequence for conversion of expression from Infix to Prefix - Data Structure

Q.  Which is the correct algorithmic sequence for the conversion of an expression from Infix to Prefix?

A. Change of every '(' (opening bracket) by ')' (closing bracket) and vice-versa.
B. Reversal of an infix expression.
C. Conversion of the modified expression into postfix form.
D. Reversal of postfix expression.
- Published on 28 Aug 15

a. A, B, C, D
b. C, A, D, B
c. B ,A, C, D
d. D, B, A, C

ANSWER: B ,A, C, D

Related Content

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲