Answer to Question #228511 in Algorithms for umme habiba sumi

Question

Translate each infix expression into its equivalent prefix and postfix expression.

i) (A+B) / (D-C) ;

ii) (A+BꜛD)/(E-F)+G ;

iii) A *(B+D)/E(G+H/k)

Answer 1

i) (A+B) / (D-C) ;
Answer:
Prefix : / +AB -DC
Postfix: AB+ DC-/

ii) (A+BꜛD)/(E-F)+G ;
Answer:
Prefix  : +/+AꜛBD-EFG
Postfix : ABDꜛ+EF-/G+
  
iii) A *(B+D)/E(G+H/k)
Prefix  : *A/+BDE+G/Hk
Postfix : ABD+*EGHk/+/