Infix to Postfix

Hard Stack: Advanced Applications PRO

🔒 Login to Unlock

Problem Statement

Write a C program to convert an infix expression to a postfix expression using a stack.

Input Format

A valid infix expression string.

Output Format

Print the converted postfix expression string.

Constraints

1 <= string length <= 100

Sample Input

A+B*C+D

Sample Output

ABC*+D+

Explanation

Scan expression, output operands directly, push operators to stack based on operator precedence rules, and pop when appropriate.

Starter Code

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int prec(char c) {
    if (c == '^') return 3;
    if (c == '*' || c == '/') return 2;
    if (c == '+' || c == '-') return 1;
    return -1;
}

int main() {
    char expr[100];
    if (scanf("%s", expr) == 1) {
        // Write your code here to convert infix to postfix
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock