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

Recall & Review

beginner

What is a Stack in data structures?

A Stack is a collection where elements are added and removed from the top only. It follows Last In, First Out (LIFO) order, like a stack of plates where you take the top plate first.

beginner

What is a Queue in data structures?

A Queue is a collection where elements are added at the back and removed from the front. It follows First In, First Out (FIFO) order, like a line at a ticket counter where the first person in line is served first.

intermediate

When should you use a Stack?

Use a Stack when you need to reverse things, track recent actions, or manage nested tasks. Examples: undo buttons, backtracking in games, or parsing expressions.

intermediate

When should you use a Queue?

Use a Queue when you want to process things in the order they arrive. Examples: printing tasks, customer service lines, or breadth-first search in graphs.

beginner

What is the main difference between Stack and Queue?

Stack removes the most recent item added (LIFO), while Queue removes the oldest item added (FIFO). This difference decides which one to use based on the problem's order needs.

Which data structure follows Last In, First Out (LIFO)?

A Array

B Queue

C Stack

D Linked List

Stack follows LIFO, meaning the last element added is the first to be removed.

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

A Queue

B Graph

C Tree

D Stack

Queue processes elements in First In, First Out (FIFO) order, perfect for tasks arriving in sequence.

What real-life example best represents a Queue?

A A stack of books

B A line at a grocery store

C A pile of plates

D A nested folder structure

A line at a grocery store is a queue where the first person to arrive is served first.

Which data structure would you use for an undo feature in a text editor?

A Queue

B Hash Table

C Graph

D Stack

Undo features use Stack to reverse recent actions in LIFO order.

If you want to process print jobs in the order they were sent, which data structure fits best?

A Queue

B Stack

C Set

D Tree

Queue processes print jobs in the order they arrive (FIFO).

Explain the main difference between a Stack and a Queue and give one example use case for each.

Think about how items are added and removed in each.

Describe a real-life situation where using a Queue is better than a Stack and why.

Consider situations where fairness and order are important.

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. Graph

B. Stack

C. Tree

D. Queue

Solution

1. Step 1: Understand the order of processing

   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 D

4. Quick Check:

   FIFO = Queue [OK]

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

Common Mistakes:

• Choosing stack which is last-in, first-out
• Confusing queue with tree or graph
• Thinking stack can process in arrival order

2. Which of the following is the correct way to add an element to a stack in JavaScript using an array named stack?

easy

A. stack.unshift(element);

B. stack.shift(element);

C. stack.push(element);

D. stack.pop(element);

Solution

1. Step 1: Identify stack insertion method

   Stacks add elements on top, so we use push() to add at the end of the array.

2. Step 2: Check JavaScript array methods

   push() adds element at the end, shift() removes from front, unshift() adds at front, pop() removes from end.

3. Final Answer:

   stack.push(element); -> Option C

4. Quick Check:

   Stack add = push() [OK]

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

Common Mistakes:

• Using shift() which removes from front
• Using unshift() which adds at front (queue behavior)
• Using pop() which removes element

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

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

medium

A. [1, 2, 3]

B. [2, 3]

C. [3, 2]

D. [1, 3]

Solution

1. Step 1: Trace queue operations

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

2. Step 2: Determine queue state after shift()

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

3. Final Answer:

   [2, 3] -> Option B

4. Quick Check:

   shift() removes first element [OK]

Hint: shift() removes first element from queue [OK]

Common Mistakes:

• Thinking push adds to front
• Confusing shift() with pop()
• Expecting original array unchanged

4. The following code is intended to implement a stack using an array, but it has a bug. What is the bug?

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

medium

A. Using shift() removes bottom element, not top

B. push() should be replaced with pop()

C. stack is not initialized correctly

D. Missing return statement

Solution

1. Step 1: Understand stack behavior

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

2. Step 2: Identify incorrect method usage

   shift() removes first element (bottom), so using shift() breaks stack LIFO behavior.

3. Final Answer:

   Using shift() removes bottom element, not top -> Option A

4. Quick Check:

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

Hint: Use pop() to remove top from stack [OK]

Common Mistakes:

• Using shift() instead of pop()
• Thinking push() removes element
• Confusing stack with queue methods

5. You are designing a browser's back button feature. Which data structure is best to store the history of visited pages and why?

hard

A. Stack, because the last visited page should be returned first

B. Queue, because pages are visited in order and removed from front

C. Graph, because pages link to each other

D. Array, because it allows random access

Solution

1. Step 1: Understand back button behavior

   The back button returns to the last visited page first, so last-in, first-out (LIFO) order is needed.

2. Step 2: Match data structure to LIFO

   Stack follows LIFO, so it is the best choice to store history for back navigation.

3. Final Answer:

   Stack, because the last visited page should be returned first -> Option A

4. Quick Check:

   Back button = LIFO = Stack [OK]

Hint: Back button needs last-in, first-out order [OK]

Common Mistakes:

• Choosing queue which is FIFO
• Thinking graph or array fits better
• Ignoring order of page visits