9 docs tagged with "Heap"

A comprehensive guide to Fibonacci Heap - a heap data structure with amortized O(1) insert and merge operations, used in advanced graph algorithms.

An advanced heap data structure supporting insert in O(1), extract-min in O(log n), and decrease-key in O(1) amortized time, used to optimise Dijkstra's algorithm.

Heaps are useful for merging multiple sorted lists efficiently and solving problems related to merging sorted sequences.

Heaps provide an efficient way to manage and retrieve median values from a stream of data by balancing two heaps.

Find the Kth largest element in an array using a heap data structure.

Finding the Kth largest element in an array using a min heap data structure, commonly used in streaming and top-K problems.

Given k sorted arrays with each of size k arranged in the form of a matrix of size k * k. The task is to merge them into one sorted array.

Find the top K most frequent elements in an array using a hash map and a heap.

A comprehensive guide to Treap - a randomized BST that combines properties of Binary Search Trees and heaps for self-balancing.