Queue vs Stack When to Use Which in DSA Javascript - Complexity Comparison

Time Complexity: Queue vs Stack When to Use Which

O(1) for stack push/pop and queue enqueue; O(n) for queue dequeue with array shift

Understanding Time Complexity

We want to understand how fast operations happen in queues and stacks.

Which one is better for different tasks and why?

Scenario Under Consideration

Analyze the time complexity of basic queue and stack operations.

// Stack example
class Stack {
  constructor() {
    this.items = [];
  }
  push(element) {
    this.items.push(element); // add to end
  }
  pop() {
    return this.items.pop(); // remove from end
  }
}

// Queue example
class Queue {
  constructor() {
    this.items = [];
  }
  enqueue(element) {
    this.items.push(element); // add to end
  }
  dequeue() {
    return this.items.shift(); // remove from front
  }
}
    

This code shows how stacks add/remove from one end, and queues add at one end and remove from the other.

Identify Repeating Operations

Look at the main operations that repeat when using these structures.

• Primary operation: push/pop for stack, enqueue/dequeue for queue
• How many times: Each operation runs once per element added or removed
• Stack uses array end for both add and remove, queue uses array end to add and front to remove

How Execution Grows With Input

Adding or removing one element takes about the same time no matter how many elements are inside.

Input Size (n)	Approx. Operations per add/remove
10	1 operation
100	1 operation
1000	1 operation for stack, more for queue dequeue

Stack operations stay constant time. Queue enqueue is constant, but dequeue can take longer as it shifts elements.

Final Time Complexity

Time Complexity: O(1) for stack push/pop and queue enqueue; O(n) for queue dequeue using array shift

Stack operations are always quick; queue dequeue can slow down as it moves all elements forward.

Common Mistake

[X] Wrong: "Queue dequeue is always as fast as stack pop because both remove one element."

[OK] Correct: Queue dequeue using array shift moves all other elements, making it slower as size grows.

Interview Connect

Knowing when stack or queue operations are fast helps you choose the right tool for the job and explain your choices clearly.

Self-Check

"What if we used a linked list instead of an array for the queue? How would the time complexity of dequeue change?"

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