Heap

260+ posts

Last Updated: 16 April 2024

What is Data Structure?A data structure is a particular way of organising data in a computer so that it can be used effectively. The idea is...read more

Arrays

Linked List

Tree

Graph

Building Heap from Array

Last Updated: 14 July 2023

Given an array of N elements. The task is to build a Binary Heap from the given array. The heap can be either Max Heap or Min Heap.Examples: ...read more

Insertion and Deletion in Heaps

Last Updated: 10 October 2023

Deletion in Heap:Given a Binary Heap and an element present in the given Heap. The task is to delete an element from this Heap.The standard ...read more

Similar Topics

DSA

22.1k+ articles

Mathematical

7.7k+ articles

Arrays

6.4k+ articles

Greedy

2k+ articles

Algorithms

2k+ articles

Amazon

1.8k+ articles

Sorting

1.7k+ articles

Data Structures

1.1k+ articles

Queue

350+ articles

priority-queue

130+ articles

Max Heap in Java

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...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 wi ...read more

K’th Smallest/Largest Element in Unsorted Array

Last Updated: 31 May 2024

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 ar ...read more

Last Updated: 06 February 2024

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 Binar...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}, ...read more

Heap Sort - Data Structures and Algorithms Tutorials

Last Updated: 29 March 2024

Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to the selection sort where we first fi...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 ass...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) ti ...read more

Find Median from Running Data Stream

Last Updated: 03 October 2023

Given that integers are read from a data stream. Find the median of elements read so far in an efficient way.There are two cases for median ...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) dow ...read more

Analysis of Algorithms

Heap

DSA

Sliding Window Maximum (Maximum of all subarrays of size K)

Last Updated: 11 March 2024

Given an array and an integer K, find the maximum for each and every contiguous subarray of size K.Examples : Input: arr[] = {1, 2, 3, 1, 4...read more

Print K largest(or smallest) elements in an array

Last Updated: 29 April 2024

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 orderEx ...read more

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>