Queue vs Stack When to Use Which in DSA C - Visual Comparison

Concept Flow - Queue vs Stack When to Use Which

Start

↓

Need to store items

↓

Is order important?

Yes↓

Is first-in-first-out needed?

No→Use Stack

Yes↓

Use Queue

↓

Perform operations accordingly

↓

End

Decide between Queue and Stack by checking if you need first-in-first-out (Queue) or last-in-first-out (Stack) behavior.

Execution Sample

DSA C

/* Using Stack */
push(1);
push(2);
pop(); // returns 2

/* Using Queue */
enqueue(1);
enqueue(2);
dequeue(); // returns 1

Shows how Stack returns last pushed item first, Queue returns first enqueued item first.

Execution Table

Step	Operation	Data Structure	State Before	Action	State After	Visual State
1	push(1)	Stack	empty	Add 1 on top	1	[1] (top)
2	push(2)	Stack	1	Add 2 on top	2 -> 1	[2 (top) -> 1]
3	pop()	Stack	2 -> 1	Remove top (2)	1	[1 (top)]
4	enqueue(1)	Queue	empty	Add 1 at rear	1	[1 (front/rear)]
5	enqueue(2)	Queue	1	Add 2 at rear	1 -> 2	[1 (front) -> 2 (rear)]
6	dequeue()	Queue	1 -> 2	Remove front (1)	2	[2 (front/rear)]
7	pop() on empty Stack	Stack	empty	No element to remove	empty	[]
8	dequeue() on empty Queue	Queue	empty	No element to remove	empty	[]

💡 Operations stop after empty structure attempts; no more elements to remove.

Variable Tracker

Variable	Start	After Step 1	After Step 2	After Step 3	After Step 4	After Step 5	After Step 6	After Step 7	After Step 8
Stack	empty	[1]	[2,1]	[1]	[1]	[1]	[1]	empty	empty
Queue	empty	empty	empty	empty	[1]	[1,2]	[2]	[2]	empty

Key Moments - 3 Insights

Why does pop() remove the last pushed item in a Stack?

Because Stack follows last-in-first-out order, pop() always removes the top item added last, as shown in execution_table step 3.

Why does dequeue() remove the first enqueued item in a Queue?

Queue follows first-in-first-out order, so dequeue() removes the front item added earliest, as seen in execution_table step 6.

What happens when pop() or dequeue() is called on an empty structure?

No element is removed and the structure remains empty, as shown in execution_table steps 7 and 8.

Visual Quiz - 3 Questions

Look at the execution_table at step 3, what is the Stack state after pop()?

A 1

B 2 -> 1

C empty

D 3 -> 2 -> 1

💡 Hint

Check the 'State After' column for step 3 in execution_table.

At which step does the Queue first contain two elements?

A Step 4

B Step 6

C Step 5

D Step 3

💡 Hint

Look at the 'State After' column for Queue operations in execution_table.

If we call pop() twice after step 2, what will be the Stack state?

A 1

B empty

C 2

D 2 -> 1

💡 Hint

Step 2 shows Stack has 2 -> 1; popping twice removes both.

Concept Snapshot

Queue vs Stack Quick Guide:
- Stack: Last In First Out (LIFO)
- Queue: First In First Out (FIFO)
- Use Stack when you need to reverse order or track recent items
- Use Queue when order matters and you process items in arrival order
- pop() removes from Stack top; dequeue() removes from Queue front

Full Transcript

This lesson compares Queue and Stack data structures by showing their behavior step-by-step. Stack adds items on top and removes the last added item first (LIFO). Queue adds items at the rear and removes the earliest added item first (FIFO). The execution table traces push, pop, enqueue, and dequeue operations, showing how the data structures change. Key moments clarify why pop removes the last item and dequeue removes the first. The visual quiz tests understanding of states after operations. Use Stack when you want to process items in reverse order, and Queue when you want to process items in the order they arrive.

Practice

1. Which data structure should you use when you want to process tasks in the exact order they arrive, like customers waiting in line at a store?

easy

A. Queue, because it processes elements in First-In-First-Out order

B. Stack, because it processes elements in Last-In-First-Out order

C. Array, because it allows random access

D. Tree, because it organizes data hierarchically

Solution

1. Step 1: Understand the order of processing tasks

   Tasks arriving in order and processed in the same order means First-In-First-Out (FIFO).

2. Step 2: Match FIFO with the correct data structure

   Queue follows FIFO, so it fits the scenario of customers waiting in line.

3. Final Answer:

   Queue, because it processes elements in First-In-First-Out order -> Option A

4. Quick Check:

   FIFO = Queue [OK]

Hint: FIFO means use Queue, like a line of customers [OK]

Common Mistakes:

• Confusing FIFO with LIFO
• Choosing Stack for ordered processing
• Thinking arrays maintain insertion order automatically

2. Which of the following is the correct way to push an element onto a stack in C?

easy

A. push(element, stack);

B. stack.push(element);

C. stack->push(element);

D. push(stack, element);

Solution

1. Step 1: Recall typical C stack function syntax

   In C, stack operations are usually functions taking the stack and element as arguments.

2. Step 2: Identify correct function call order

   push(stack, element) is the standard way to push an element onto a stack in C.

3. Final Answer:

   push(stack, element); -> Option D

4. Quick Check:

   Function call with stack first = push(stack, element) [OK]

Hint: In C, function calls usually have data structure first [OK]

Common Mistakes:

• Using object.method() syntax which is not C style
• Swapping argument order in function call
• Assuming stack is a pointer with methods

3. What will be the output of the following C code snippet using a stack?

#include 
#include 

#define MAX 5

typedef struct {
    int items[MAX];
    int top;
} Stack;

void push(Stack *s, int val) {
    if (s->top == MAX - 1) return;
    s->items[++s->top] = val;
}

int pop(Stack *s) {
    if (s->top == -1) return -1;
    return s->items[s->top--];
}

int main() {
    Stack s;
    s.top = -1;
    push(&s, 10);
    push(&s, 20);
    push(&s, 30);
    printf("%d ", pop(&s));
    printf("%d ", pop(&s));
    return 0;
}

medium

A. 10 20

B. 30 20

C. 20 10

D. 30 10

Solution

1. Step 1: Trace push operations on stack

   Push 10, stack: [10]; push 20, stack: [10,20]; push 30, stack: [10,20,30]. Top points to 30.

2. Step 2: Trace pop operations and output

   First pop returns 30, second pop returns 20, so output is "30 20 ".

3. Final Answer:

   30 20 -> Option B

4. Quick Check:

   LIFO pop order = 30 then 20 [OK]

Hint: Stack pops last pushed first (LIFO) [OK]

Common Mistakes:

• Assuming FIFO order for stack
• Mixing push and pop order
• Ignoring initial top = -1

4. The following C code tries to implement a queue but has a bug. What is the main issue?

#include 
#define MAX 3

int queue[MAX];
int front = -1, rear = -1;

void enqueue(int val) {
    if (rear == MAX - 1) {
        printf("Queue full\n");
        return;
    }
    queue[++rear] = val;
    if (front == -1) front = 0;
}

int dequeue() {
    if (front == -1 || front > rear) {
        printf("Queue empty\n");
        return -1;
    }
    return queue[front++];
}

int main() {
    enqueue(1);
    enqueue(2);
    enqueue(3);
    dequeue();
    enqueue(4);
    printf("%d\n", queue[rear]);
    return 0;
}

medium

A. The enqueue function uses wrong index for insertion

B. The dequeue function returns wrong element

C. The queue does not reset front and rear after dequeueing all elements, causing overflow

D. The queue size is too large

Solution

1. Step 1: Understand enqueue and dequeue behavior

   Enqueue adds at rear, dequeue removes from front. After dequeueing all, front > rear but variables not reset.

2. Step 2: Identify problem with overflow after dequeue

   After dequeueing, rear stays at max index, so enqueue thinks queue is full even if space is free.

3. Final Answer:

   The queue does not reset front and rear after dequeueing all elements, causing overflow -> Option C

4. Quick Check:

   Queue pointers not reset = overflow bug [OK]

Hint: Reset front and rear when queue becomes empty [OK]

Common Mistakes:

• Ignoring front and rear reset after emptying queue
• Thinking enqueue index is wrong
• Assuming dequeue returns wrong element

5. You need to design a system that supports undo and redo operations for text editing. Which data structure(s) should you use and why?

hard

A. Two stacks: one for undo and one for redo, because stacks support LIFO order needed for undo/redo

B. One queue, because it processes commands in order

C. One stack only, because redo is not needed

D. Two queues, because they maintain order of commands

Solution

1. Step 1: Understand undo/redo operation order

   Undo reverses last action (LIFO), redo re-applies undone actions in reverse order.

2. Step 2: Choose data structures matching LIFO behavior

   Two stacks allow pushing actions for undo and redo separately, supporting LIFO order for both.

3. Final Answer:

   Two stacks: one for undo and one for redo, because stacks support LIFO order needed for undo/redo -> Option A

4. Quick Check:

   Undo/Redo = Two stacks (LIFO) [OK]

Hint: Undo/Redo needs two stacks for LIFO operations [OK]

Common Mistakes:

• Using queues which are FIFO, not suitable for undo
• Ignoring redo functionality
• Using only one stack which can't handle redo