A binary heap is a complete binary tree that satisfies the heap ordering property. The ordering can be one of two types: The min-heap property: The value of each node is greater than or equal to the value of its parent, with the minimum-value element at the root. The max-heap property: The value of each node is less than or equal to the value of its parent, with the maximum-value element at the root. It is a useful data structure if you need to remove the object with the highest (or lowest) priority. A common use of a heap is to implement a priority queue.
By Aman kumar Chourasiya
● Published At Jan 2022
This blog discusses the concept and implementation of the binary heap data structure. We will also see the applications of binary heaps in some well known algorithms and library implementations.... Keep reading ..
Tournament Trees and Binary Heaps
By Akshat Chaturvedi
● Published At Oct 2021
In this blog post, we’ll see what Tournament Trees (Selection Trees) are and why we use these in data structures. ... Keep reading ..
Top Problems related to Binary Heap
Insertion in a Priority queue -Max Heap
Convert Min-Heap to Max-Heap
Last Stone Weight
Fourth Largest Element in the Array
K Most Frequent Words
Minimum K product
Gary and multiplication
Kth largest element
Minimum Character Deletion
Rearrange The Array
Kth largest element in the unsorted array
Kth Smallest Element
K-th Largest Sum Subarray
Magician and Chocolates
Median in a stream