Converting Infix to Postfix

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

Parse the given input string from left to right

      Input         Post-Fix

            Stack
   Expression    Expression

       (

       A A

       +              + A

       ( A

        B AB

        +            + + AB

        C            ++ ABC

         )            + ABC+

        -             - ABC++

        D             - ABC+D

        *             - ABC+D*

       )           ABC+D*-

       /           /

       F ABC+D*-F

   ABC+D*-F/

Converting Infix to Prefix

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

 Reverse the input string first and parse the given input string from left to right

   F/)E*D-)C+B(*A(

The final output string obtained is reversed again to obtain prefix expression

     /+A-+BC*DEF
Prefix expression to infix 
+/A-BCD
A/B-C+D

Post fix expression to infix

 A B / C + D *   
  A/B+C*D