Priority Queue Introduction and Concept in DSA Javascript - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a Priority Queue?

A Priority Queue is a special type of queue where each element has a priority. Elements with higher priority are served before elements with lower priority, unlike a normal queue which serves elements in the order they arrive.

beginner

How does a Priority Queue differ from a regular Queue?

In a regular queue, elements are served in the order they arrive (first-in, first-out). In a Priority Queue, elements are served based on their priority, not just arrival order.

beginner

What real-life example can help understand Priority Queues?

Think of a hospital emergency room. Patients with more serious conditions (higher priority) are treated before those with minor issues, regardless of who arrived first.

beginner

What are the main operations of a Priority Queue?

The main operations are: 1) Insert an element with a priority, 2) Remove the element with the highest priority, 3) Peek at the element with the highest priority without removing it.

intermediate

What data structure is commonly used to implement a Priority Queue efficiently?

A heap (usually a binary heap) is commonly used because it allows quick insertion and removal of the highest priority element.

In a Priority Queue, which element is removed first?

A A random element

B The element that arrived first

C The element with the highest priority

D The element with the lowest priority

Priority Queues always remove the element with the highest priority first.

Which of these is NOT a typical operation of a Priority Queue?

A Remove the highest priority element

B Sort all elements in ascending order

C Insert an element with priority

D Peek at the highest priority element

Sorting all elements is not a typical operation; Priority Queues focus on insertion, removal, and peeking based on priority.

Which data structure is commonly used to implement a Priority Queue efficiently?

A Heap

B Stack

C Linked List

D Array

Heaps allow efficient insertion and removal of the highest priority element, making them ideal for Priority Queues.

In a hospital emergency room analogy, who gets treated first?

A The patient with the most serious condition

B The patient who arrived first

C The patient who is the youngest

D The patient who is the oldest

Patients with the most serious condition (highest priority) are treated first, illustrating Priority Queue behavior.

What happens if two elements have the same priority in a Priority Queue?

A They are removed in random order

B They are merged into one element

C The queue rejects the second element

D They are removed in the order they arrived

If priorities are equal, many Priority Queue implementations remove elements in the order they arrived (FIFO for same priority).

Explain what a Priority Queue is and how it works using a simple real-life example.

Think about who gets served first in an emergency room.

Describe the main operations of a Priority Queue and why a heap is often used to implement it.

Focus on how elements are added and removed based on priority.

Practice

1. What is the main difference between a Priority Queue and a regular queue?

easy

A. Elements are always dequeued in the order they were enqueued

B. Elements are dequeued based on priority, not just order of arrival

C. It only stores numbers, not other data types

D. It uses a stack internally to manage elements

Solution

1. Step 1: Understand queue behavior

   A regular queue removes elements in the order they arrive (FIFO).

2. Step 2: Understand priority queue behavior

   A priority queue removes elements based on their priority, not just arrival order.

3. Final Answer:

   Elements are dequeued based on priority, not just order of arrival -> Option B

4. Quick Check:

   Priority Queue = priority-based removal [OK]

Hint: Priority queue removes highest priority first, not oldest [OK]

Common Mistakes:

• Thinking priority queue works like a normal queue
• Assuming priority queue only stores numbers
• Confusing priority queue with stack

2. Which of the following is the correct way to declare a priority queue class in JavaScript?

easy

A. let PriorityQueue = () => { this.items = []; }

B. function PriorityQueue() { this.items = {}; }

C. class PriorityQueue { constructor() { this.items = []; } }

D. var PriorityQueue = new Array();

Solution

1. Step 1: Check class syntax

   class PriorityQueue { constructor() { this.items = []; } } uses correct ES6 class syntax with constructor initializing an array.

2. Step 2: Check other options

   function PriorityQueue() { this.items = {}; } uses function but initializes an object, not array; let PriorityQueue = () => { this.items = []; } uses arrow function incorrectly for class; var PriorityQueue = new Array(); assigns array directly, not a class.

3. Final Answer:

   class PriorityQueue { constructor() { this.items = []; } } -> Option C

4. Quick Check:

   Correct class syntax = class PriorityQueue { constructor() { this.items = []; } } [OK]

Hint: Use ES6 class with constructor for priority queue [OK]

Common Mistakes:

• Using arrow functions as classes
• Initializing items as object instead of array
• Assigning array directly without class

3. Consider this JavaScript code using a simple priority queue implementation:

class PriorityQueue {
  constructor() {
    this.items = [];
  }
  enqueue(element, priority) {
    this.items.push({element, priority});
    this.items.sort((a, b) => a.priority - b.priority);
  }
  dequeue() {
    return this.items.shift().element;
  }
}

const pq = new PriorityQueue();
pq.enqueue('A', 2);
pq.enqueue('B', 1);
pq.enqueue('C', 3);
console.log(pq.dequeue());

What will be printed?

medium

A. 'B'

B. 'A'

C. 'C'

D. undefined

Solution

1. Step 1: Analyze enqueue operations

   Elements are added with priorities: A(2), B(1), C(3). After each enqueue, array is sorted by priority ascending.

2. Step 2: Analyze dequeue operation

   Dequeue removes first element (lowest priority number). After sorting, order is B(1), A(2), C(3). So dequeue returns 'B'.

3. Final Answer:

   'B' -> Option A

4. Quick Check:

   Lowest priority dequeued first = 'B' [OK]

Hint: Lowest priority number dequeued first [OK]

Common Mistakes:

• Assuming FIFO order instead of priority
• Confusing priority sorting order
• Forgetting to return element, not object

4. The following code is intended to implement a priority queue, but it has a bug:

class PriorityQueue {
  constructor() {
    this.items = [];
  }
  enqueue(element, priority) {
    this.items.push({element, priority});
  }
  dequeue() {
    return this.items.shift().element;
  }
}

What is the main problem with this code?

medium

A. It stores elements as objects instead of arrays

B. It uses shift() instead of pop() to remove elements

C. It does not initialize items array in constructor

D. It does not sort items by priority before dequeue

Solution

1. Step 1: Check enqueue method

   Enqueue adds elements but does not sort by priority.

2. Step 2: Check dequeue method

   Dequeue removes first element, but without sorting, priority order is not guaranteed.

3. Final Answer:

   It does not sort items by priority before dequeue -> Option D

4. Quick Check:

   Missing sorting causes wrong dequeue order [OK]

Hint: Sort items by priority before dequeue [OK]

Common Mistakes:

• Assuming shift() removes highest priority
• Ignoring sorting requirement
• Confusing object vs array storage

5. You want to implement a priority queue that supports fast insertion and removal of the highest priority element. Which data structure is best suited for this, and why?

hard

A. Binary heap, because it provides efficient insert and remove operations

B. Linked list, because it maintains insertion order

C. Stack, because it removes the last inserted element quickly

D. Array, because it allows easy sorting after each insertion

Solution

1. Step 1: Understand operation needs

   Priority queue needs fast insertion and removal of highest priority element.

2. Step 2: Compare data structures

   Array requires sorting after insertion (slow). Linked list maintains order but slow for priority. Stack removes last inserted only. Binary heap supports insert and remove in O(log n) time efficiently.

3. Final Answer:

   Binary heap, because it provides efficient insert and remove operations -> Option A

4. Quick Check:

   Binary heap = efficient priority queue [OK]

Hint: Use binary heap for efficient priority queue operations [OK]

Common Mistakes:

• Choosing array and ignoring sorting cost
• Confusing stack with priority queue
• Ignoring time complexity of operations