Problem Statement :
Given the heights of
Nbuildings and an integer
kfind the height of
Solution Approach :
Idea is to create a max-heap of heights of buildings, in order to get
kthhighest height we need go remove first
Method 1 :
Sort the array containing heights of the buildings in decreasing order using any sorting algorithm in data structures and algorithms.. Now print the
kthvalue in the array which is the
Method 2 :
Geneate a max-heap from the heights of the buildings.
In a max-heap, the root always stores the larger value as compared to its left & right subtree, this condition needs to be true for every node. We need to insert each item one by one such that parent is always larger than the item itself. If parent is smaller, then swap the current item with its parent.
After generating max-heap now extract first
k-1heights from the heap. Among the remaining heights, the first element of the heap (
heap) is the
extract(): Removes the maximum element from Max-Heap. Time Complexity of this Operation is O(Logn) as this operation needs to maintain the heap property (by calling heapify()) after removing root.
heapify(): Maintains the heap property for each node. If any node does not follow heap property it swaps the node with the node which is smaller ,or greater (in case of max-heap), than the node.
- Insert the item at the last index, and increment the size by 1.
- Then, check if the inserted item is smaller than its parent,
- If yes, then swap the inserted item with its parent.
- If no, then do nothing.
- Now, go to step
2and repeat untill we reach root (first element).
- Store the value of the first node of our heap (
temp = heap).
- Replace the root node with the farthest right node (last element).
- Decrease the size by
(heap = heap[size-1])
- Perform heapify starting from the new root.
- Return the stored value (
Heapify () :
- if the heap property holds true then you are done.
- else if
- the replacement node value < its parent nodes value
then swap them, and repeat step 3.
- swap the replacement node with the largest child node, and
repeat step 3.