Understanding Heaps and Priority Queues in TypeScript

Welcome to our exploration of the intriguing worlds of heaps and priority queues. These are powerful data structures used extensively across a range of applications, from job scheduling systems to modeling the stock market. Heaps can efficiently solve problems involving intervals, nth largest elements, and even sorting. Leveraging TypeScript’s static typing with libraries like heap-js enhances the understanding and implementation of data structures, providing clarity, robustness, and convenient functions to interact with lists as if they were heaps.

Heaps are a category of binary trees where every node has a value that is either less than the value of any of its children, in which case it is called a MinHeap, or greater than or equal to the value of any of its children, in which case it is called a MaxHeap. This property allows us to repeatedly access the smallest or largest element, respectively, enabling us to solve numerous problems effortlessly. For example, if you want to find the n-th largest number in a list, using sorting to solve this problem can be very expensive. By leveraging a MaxHeap data structure, this problem can be solved efficiently.

Priority queues are an abstraction over heaps that store elements according to their priorities. They are used when objects need to be processed based on priority. For instance, scheduling CPU tasks based on priority is a real-life scenario for priority queues.

Heaps provide efficient time complexities for insertion, deletion, and access operations.

• Insertion of a new element into the heap takes $O(\log n)$ time.
• Deletion, particularly removal of the maximum or minimum element, also takes $O(\log n)$ time.
• Accessing the maximum or minimum element is done in $O(1)$ time.

Consider the problem of finding the n-th largest element in a list of integers. Using a MaxHeap significantly reduces the complexity compared to sorting the entire list.

Here is how you can do it in TypeScript:

import { Heap } from 'heap-js';

function findNthLargest(nums: number[], n: number): number | null {
    // Create a MaxHeap by providing a comparator function
    const maxHeap = new Heap<number>((a, b) => b - a); // MaxHeap comparator (larger elements come first)

    nums.forEach(num => maxHeap.push(num));   // Add every element to the heap
    let result: number | null = null;

    for (let i = 0; i < n; i++) {
        result = maxHeap.pop() ?? null;      // Extract n largest elements from the heap
    }

    return result;                           // The last extracted element is the nth largest element
}

// Test
console.log(findNthLargest([3, 2, 1, 5, 6, 4], 2));  // Output: 5