Answer to Question #270577 in Algorithms for Aryan

Question

Convert the following infix expressions to their postfix equivalents:

(a) A – B + C

(b) A * B + C / D

(c) (A – B ) + C * D / E – C

(d) (A * B) + (C / D) – ( D + E)

Answer 1

(a) A – B + C
Answer:
A – B C+ 
(b) A * B + C / D
Answer:
A B * C D/+
(c) (A – B ) + C * D / E – C
Answer:
A – B C D * E – C/+
(d) (A * B) + (C / D) – ( D + E)
Answer:
A B* C D/ – D E++