Question

Algorithm to construct infix to postfix expression

Answer 1

▀▄▀▄▀▄[_$<b>Hɪ Mᴀᴛᴇ$_]▄▀▄▀▄▀



ıllıllıllıllıllıllı[ Your Answer ]ıllıllıllıllıllıllı


╚» Push “(“onto Stack, and add “)” to the end of X.

Scan X from left to right and repeat Step 3 to 6 for each element of X until the Stack is empty.

If an operand is encountered, add it to Y.

If a left parenthesis is encountered, push it onto Stack.

If an operator is encountered ,then:





$<b><marquee>$


 ▁ ▂ ▄ ▅ ▆ ▇ █ [ Hᴏᴘᴇ Help You Dear ] █ ▇ ▆ ▅ ▄ ▂ ▁