Heap: Given an array, sort the array using min heap
Problem Statement: You are given a array, sort the array in decreasing order using min heap Example: Input: arr[] = {5, 4, 3, 6, 1, 2} Output:…
Heap: Convert Min Heap to Max Heap
Problem Statement: You are given an array representation of Min Heap, convert into Max Heap Example: Input: arr[] = [3, 5, 9, 6, 8, 20, 10]…
Heap: k closest number
Problem Statement: You are given a sorted array and a number k and a number x. You need to return k elements that are closest to x Example:…
Heap: Check if given a binary tree is a Heap
Problem Statement: You are given a binary tree, you need to check if the binary tree satisfies heap property or not. Below are the conditions…
Heap: Find median in a stream
Problem Statement: You are given a data stream, you need to get the median of the elements after each integer is read. Median can be found by:…
Heap: Given a BST, convert into Min Heap
Problem Statement: Given a BST that is a complete binary tree, you need to convert into Min Heap. What is a BST ? A binary tree that satisfies…
Heap: Given two max heaps, merge them
Problem Statement: You are given 2 max heaps. You need to merge them into a single max heap Example: Solution 1: Using Priority Queue Take a…
Heap: Given an array and a value K, return the kth smallest element
Problem Statement: Given an array and a value K, return the kth smallest element Example: Input: arr = [3, 6, 1, 2, 7, 8] k = 2 Output: 2…
Heap: Max Heap and Min heap using Priority Queue
In this chapter we will learn about priority queue. Priority Queue is a data structure, where each element is associated with a priority…
Heap: Heap Sort
In this chapter we will learn about heap sort. To know the basic of Heap, checkout the previous chapters. Below are the steps followed for…