Skip to content

Category Archives: Heap

Given a binary tree and an integer b representing budget. The task is to find the count of maximum number of leaf nodes that can… Read More
Given a max-heap of size n, find the kth greatest element in the max-heap.  Examples: Input : maxHeap = {20, 15, 18, 8, 10, 5,… Read More
Given a min-heap of size n, find the kth least element in the min-heap.  Examples: Input : {10, 50, 40, 75, 60, 65, 45} k… Read More
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… Read More
A double ended priority queue supports operations of both max heap (a max priority queue) and min heap (a min priority queue). The following operations… Read More
Huffman Coding is a lossless data compression algorithm where each character in the data is assigned a variable length prefix code. The least frequent character… Read More
Given an integer K and an array of integers arr, the task is to find the maximum element from the array and after every retrieval… Read More
Given an integer k and an array of integers arr, the task is to find the sum and product of k smallest and k largest… Read More
Given a list of N numbers, and an integer ‘K’. The task is to print the average of max ‘K’ numbers after each query where… Read More
Given an array of integers, find the k smallest numbers after deleting given elements. In case of repeating elements delete only one instance in the… Read More
Given an array of integers, find the k largest number after deleting the given elements. In case of repeating elements, delete one instance for every… Read More
Prerequisites: Binomial Heap Binomial trees are multi-way trees typically stored in the left-child, right-sibling representation, and each node stores its degree. Binomial heaps are collection… Read More
In the last post, we discussed the Insertion and Union of Fibonacci Heaps. In this post, we will discuss Extract_min(), Decrease_key() and Deletion() operations on… Read More
Fibonacci Heap is a collection of trees with min-heap or max-heap property. In Fibonacci Heap, trees can have any shape even all trees can be… Read More