Heap

240+ posts

Similar Topics

20.6k+ articles

7.6k+ articles

6.3k+ articles

2k+ articles

1.8k+ articles

1.7k+ articles

820+ articles

340+ articles

110+ articles

40+ articles

Last updated: 08 February 2023

A max-heap is a complete binary tree in which the value in each internal node is greater than or equal to the values in the children of that node. Mapping the elements of ...read more

Priority Queue in Python

Last updated: 29 August 2022

Priority Queues are abstract data structures where each data/value in the queue has a certain priority. For example, In airlines, baggage with the title “Business” or “Fir ...read more

Python-Data-Structures

DSA

Heap in C++ STL

Last updated: 12 September 2023

The heap data structure can be implemented in a range using STL which provides faster max or min item retrieval, and faster insertion and deletion on sorted data and also ...read more

K’th Smallest/Largest Element in Unsorted Array

Last updated: 18 September 2023

Given an array arr[] of size N and a number K, where K is smaller than the size of the array. Find the K'th smallest element in the given array. Given that all array eleme ...read more

Last updated: 17 April 2023

A Binary Heap is a complete Binary Tree which is used to store data efficiently to get the max or min element based on its structure.A Binary Heap is either Min Heap or Ma...read more

Heap

DSA

Merge k sorted arrays | Set 1

Last updated: 16 February 2023

Given K sorted arrays of size N each, merge them and print the sorted output.Examples:Input:K = 3, N = 4, arr = { {1, 3, 5, 7},{2, 4, 6, 8},{0, 9, 10, 11}}Output: 0 1 2 3 ...read more

Heap Sort - Data Structures and Algorithms Tutorials

Last updated: 25 July 2023

Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to the selection sort where we first find the minimum element and plac...read more

Huffman Coding | Greedy Algo-3

Last updated: 11 September 2023

Huffman coding is a lossless data compression algorithm. The idea is to assign variable-length codes to input characters, lengths of the assigned codes are based on the fr...read more

Sort a nearly sorted (or K sorted) array

Last updated: 12 April 2023

Given an array of N elements, where each element is at most K away from its target position, devise an algorithm that sorts in O(N log K) time.Examples:Input: arr[] = {6, ...read more

Median in a stream of integers (running integers)

Last updated: 30 January 2023

Given that integers are read from a data stream. Find the median of elements read so for in an efficient way. For simplicity assume, there are no duplicates. For example, ...read more

statistical-algorithms

Apple

median-finding

DSA

Time Complexity of building a heap

Last updated: 17 June 2022

Consider the following algorithm for building a Heap of an input array A.BUILD-HEAP(A) heapsize := size(A); for i := floor(heapsize/2) downto 1 do HEAPIFY(A, i); end ...read more

Analysis

Heap

DSA

Print K largest(or smallest) elements in an array

Last updated: 18 September 2023

Given an array arr[] of size N, the task is to printing K largest elements in an array. Note: Elements in output array can be in any orderExamples:Input: [1, 23, 12, 9, 30 ...read more

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>