Evaluate Postfix Expression Using Stack in DSA C - Build from Scratch

Evaluate Postfix Expression Using Stack

📖 Scenario: You are building a simple calculator that reads a postfix expression (also called Reverse Polish Notation) and calculates the result. Postfix expressions are used in calculators and computer programs to avoid confusion with parentheses.Example: The postfix expression 23+ means 2 + 3, which equals 5.

🎯 Goal: Build a program that uses a stack to evaluate a postfix expression containing single-digit numbers and the operators +, -, *, and /.

📋 What You'll Learn

Create a stack to hold integer values

Read a postfix expression as a string

Use a loop to process each character in the expression

Push numbers onto the stack

Pop two numbers when an operator is found and apply the operator

Push the result back onto the stack

Print the final result after processing the entire expression

💡 Why This Matters

🌍 Real World

Postfix expressions are used in calculators and computer programs to simplify expression evaluation without parentheses.

💼 Career

Understanding stack-based expression evaluation is important for programming language interpreters, compilers, and calculator apps.

1

Create the postfix expression string

Create a character array called postfix and initialize it with the string "231*+9-" which represents the postfix expression.

DSA C

# Create the postfix expression string
# Your code here

Hint

Use double quotes to create a string in C and assign it to postfix.

2

Create a stack and a top index

Create an integer array called stack with size 100 and an integer variable called top initialized to -1 to represent an empty stack.

DSA C

char postfix[] = "231*+9-";
// Create stack array and top variable
# Your code here

Hint

The stack is an integer array and top keeps track of the last filled position.

3

Write the loop to evaluate the postfix expression

Write a for loop using an integer i to iterate over each character of postfix until the null character '\0'. Inside the loop, if the character is a digit, push its integer value onto stack and increment top. If it is an operator (+, -, *, /), pop the top two values from stack, apply the operator, and push the result back onto stack. Use top to manage the stack positions.

DSA C

char postfix[] = "231*+9-";
int stack[100];
int top = -1;

// Loop through postfix expression and evaluate
# Your code here

Hint

Use ASCII values to convert characters to integers. Remember to pop two values for operators and push the result back.

4

Print the final result from the stack

Print the top value of the stack using printf with the format "%d\n". This value is the result of the postfix expression evaluation.

DSA C

char postfix[] = "231*+9-";
int stack[100];
int top = -1;

for (int i = 0; postfix[i] != '\0'; i++) {
    char ch = postfix[i];
    if (ch >= '0' && ch <= '9') {
        stack[++top] = ch - '0';
    } else {
        int val2 = stack[top--];
        int val1 = stack[top--];
        int result;
        if (ch == '+') result = val1 + val2;
        else if (ch == '-') result = val1 - val2;
        else if (ch == '*') result = val1 * val2;
        else if (ch == '/') result = val1 / val2;
        stack[++top] = result;
    }
}

// Print the final result
# Your code here

Hint

The final result is the only value left on the stack at position top.