Queue vs Stack When to Use Which in DSA Typescript - Key Differences

Recall & Review

beginner

What is the main difference between a stack and a queue?

A stack follows Last In First Out (LIFO) order, meaning the last item added is the first to be removed. A queue follows First In First Out (FIFO) order, meaning the first item added is the first to be removed.

beginner

When should you use a stack?

Use a stack when you need to reverse things or keep track of recent actions, like undo features, backtracking, or parsing expressions.

beginner

When is a queue the better choice?

Use a queue when you want to process things in the order they arrive, like task scheduling, handling requests, or breadth-first search in graphs.

intermediate

How does a stack help in undo operations?

Each action is pushed onto the stack. When undo is needed, the last action is popped off and reversed, following LIFO order.

intermediate

Why is a queue used in breadth-first search (BFS)?

Because BFS explores nodes level by level, it needs to process nodes in the order they were discovered, which fits the FIFO nature of a queue.

Which data structure removes the most recently added item first?

A Queue

B Stack

C Linked List

D Tree

Stack uses Last In First Out (LIFO), so it removes the most recently added item first.

Which data structure is best for processing tasks in the order they arrive?

A Stack

B Hash Table

C Graph

D Queue

Queue uses First In First Out (FIFO), so it processes tasks in the order they arrive.

What is a common use case for a stack?

A Undo functionality

B Task scheduling

C Priority handling

D Searching in a database

Undo functionality relies on reversing the most recent actions, which fits stack's LIFO behavior.

Which data structure would you use for breadth-first search (BFS)?

A Queue

B Stack

C Set

D Heap

BFS explores nodes level by level, so it uses a queue to process nodes in the order they are discovered.

If you want to reverse a list of items, which data structure helps most naturally?

A Array

B Queue

C Stack

D Graph

Stack reverses order naturally because it removes the last item added first.

Explain the key differences between a stack and a queue and give one example use case for each.

Think about the order items come out and real-life situations where order matters.

Describe why a queue is used in breadth-first search and why a stack is used in depth-first search.

Consider how nodes are explored in each search method.

Practice

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

easy

A. Stack

B. Queue

C. Array

D. Tree

Solution

1. Step 1: Understand the order requirement

   Tasks must be processed in the order they arrive, which means first-in, first-out (FIFO).

2. Step 2: Match the data structure to FIFO

   A queue follows FIFO, so it fits the requirement perfectly.

3. Final Answer:

   Queue -> Option B

4. Quick Check:

   FIFO = Queue [OK]

Hint: Use queue for first-in, first-out order [OK]

Common Mistakes:

• Confusing stack (LIFO) with queue (FIFO)
• Choosing array without order guarantees
• Thinking tree fits linear order

2. Which of the following is the correct TypeScript syntax to add an element to the top of a stack implemented as an array named stack?

easy

A. stack.unshift(element);

B. stack.pop(element);

C. stack.shift(element);

D. stack.push(element);

Solution

1. Step 1: Identify stack operation to add element

   Adding to the top of a stack means pushing an element onto it.

2. Step 2: Match with correct array method

   In TypeScript, push() adds an element to the end (top) of the array acting as a stack.

3. Final Answer:

   stack.push(element); -> Option D

4. Quick Check:

   Push adds to stack top [OK]

Hint: Use push() to add on stack top [OK]

Common Mistakes:

• Using pop() which removes instead of adds
• Using shift() or unshift() which affect queue ends
• Confusing push() with unshift()

3. What will be the output of the following TypeScript code?

const queue: number[] = [];
queue.push(1);
queue.push(2);
queue.push(3);
const first = queue.shift();
console.log(queue);

medium

A. [3, 2]

B. [1, 2, 3]

C. [2, 3]

D. []

Solution

1. Step 1: Trace queue operations

   Elements 1, 2, 3 are added to the queue using push(). Then shift() removes the first element (1).

2. Step 2: Determine queue state after removal

   After removing 1, the queue contains [2, 3].

3. Final Answer:

   [2, 3] -> Option C

4. Quick Check:

   shift() removes first, queue left with [2, 3] [OK]

Hint: shift() removes front in queue [OK]

Common Mistakes:

• Thinking push adds to front instead of back
• Confusing shift() with pop()
• Expecting stack order instead of queue order

4. The following TypeScript code is intended to implement a stack but has a bug. What is the bug?

const stack: number[] = [];
stack.push(10);
stack.push(20);
const top = stack.shift();
console.log(top);

medium

A. Using shift() instead of pop() to remove top element

B. Using push() instead of unshift() to add element

C. Not initializing the stack array

D. Using console.log incorrectly

Solution

1. Step 1: Identify stack removal method

   Stack removes the top element using pop(), not shift().

2. Step 2: Analyze code's removal method

   The code uses shift(), which removes the first element, breaking stack behavior.

3. Final Answer:

   Using shift() instead of pop() to remove top element -> Option A

4. Quick Check:

   Stack removal = pop(), not shift() [OK]

Hint: Stack removes top with pop(), not shift() [OK]

Common Mistakes:

• Confusing shift() with pop()
• Thinking push() adds to front
• Ignoring array initialization

5. You are designing a system to undo and redo user actions. Which data structure combination is best suited for this, and why?

hard

A. Two stacks: one for undo, one for redo, because stacks allow reversing actions easily

B. Two queues: one for undo, one for redo, because queues maintain order of actions

C. One stack only, because redo is not needed

D. One queue only, because undo and redo are processed in order

Solution

1. Step 1: Understand undo/redo requirements

   Undo and redo require reversing and reapplying actions in last-in, first-out order.

2. Step 2: Match data structures to behavior

   Stacks naturally support LIFO, so using two stacks (undo and redo) allows easy push/pop for these operations.

3. Final Answer:

   Two stacks: one for undo, one for redo, because stacks allow reversing actions easily -> Option A

4. Quick Check:

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

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

Common Mistakes:

• Using queues which do not reverse order easily
• Ignoring redo functionality
• Using only one data structure