## EXPERT ANSWER

*INPUT :A*+*B*∗(*C*∧*D*−*E*)∧(*F*+*G*∗*H*)−*I**OUPUT:*ABCD∧E−FGHH∗+∧+ICONCEPTS OF STACKS ARE USED HERE TO SOLVE THE PROBLEM

Skip to content
# Problem 2. Write a program to convert an infix expression that includes ∧ ,(),,+,−,∗ , and / to postfix. Given an infix expression in the form of a string str. Convert this infix expression to postfix expression. – Infix expression: The expression of the form A op B. When an operator is in-between every pair of operands. – Postfix expression: The expression of the form A B op. When an operator is followed for every pair of operands. Example: – Input-Infix expression: A+B ∗ (C ∧ D−E) ∧ (F+G ∗ H)−I Output – Postfix expression: ABCD ∧ E−FGHH ∗ + ∧ +I – – Input – Infix expression: A ∗ (B+C)/D Output – Postfix expression: ABC+∗D/

## EXPERT ANSWER

X
##### Choose your mode of payment

*INPUT :A*+*B*∗(*C*∧*D*−*E*)∧(*F*+*G*∗*H*)−*I**OUPUT:*ABCD∧E−FGHH∗+∧+ICONCEPTS OF STACKS ARE USED HERE TO SOLVE THE PROBLEM