Prefix To Infix Conversion C Program

By | October 26, 2016

Learn How To Convert Prefix To Infix Notation using Stack in C Programming Language. The Prefix notation is also known as Polish Notation. Before you proceed further with this code, you must know the complete operations of stack data structure.

Prefix To Infix Conversion Example

Prefix String: +22

Infix String: 2 + 2

Algorithm To Convert Prefix Expression into Infix Notation

 

  1. The Reversed Prefix Expression is pushed on the Stack.
  2. If the Stack is not Empty, then Pop the elements from the Stack
  3. If the popped character is an Operator
    1. Input Opening Parantheses ‘(‘ and print it on the console.
    2. Display popped character from the Stack.
    3. Input Closing Parantheses ‘)’ and print it on the console.
  4. If the popped character is an empty space, then print it on the console.
  5. Repeat the steps till the Prefix expression is not scanned completely.

C Program For Prefix To Infix Conversion using Stack Data Structure

Output

C Program To Convert Prefix To Infix using Stack

In case you get any compilation errors or any doubts in this C Program For Conversion of Prefix Expression into Infix Expression, let us know about it in the Comment Section below.

Recommended Programs
C Program For Shell Sort Algorithm
C Program To Convert Infix Expression into Postfix using Stack
C Program For Prefix Expression Evaluation using Stack
C Program For Prim’s Algorithm
C Program To Convert Postfix Expression into Prefix using Stack
C Program For Postfix Expression Evaluation using Stack
C Program To Convert Infix Expression into Prefix using Stack
C Program To Convert Postfix Expression into Infix using Stack
C Program To Check Magic Number
C Program To Check Balanced Parantheses using Stack

One thought on “Prefix To Infix Conversion C Program

  1. seemavk

    im getting segmentation error for the above code of prefix to infix. can anyone please help me!!!!

    Reply

Let's Discuss