# Kth Largest element

Heap

Hard

#### Problem Statement :

Given the heights of `N` buildings and an integer `k` find the height of `kth` highest building.

See original problem statement here

#### Introduction :

Idea is to create a max-heap of heights of buildings, in order to get `kth` highest height we need go remove first `k-1` largest height.

#### 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 `kth` value in the array which is the `kth` highest height.

#### 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-1` heights from the heap. Among the remaining heights, the first element of the heap (`heap`) is the `kth` highest element.

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() :

1. Insert the item at the last index, and increment the size by 1.
2. Then, check if the inserted item is smaller than its parent,
3. If yes, then swap the inserted item with its parent.
4. If no, then do nothing.
5. Now, go to step `2` and repeat untill we reach root (first element).

#### Extract() :

1. Store the value of the first node of our heap ( `temp = heap` ).
2. Replace the root node with the farthest right node (last element).
3. Decrease the size by `1`. `(heap = heap[size-1])`
4. Perform heapify starting from the new root.
5. Return the stored value (`temp`).

#### Heapify () :

1. if the heap property holds true then you are done.
2. else if
3. the replacement node value < its parent nodes value
then swap them, and repeat step 3.
4. else
5. swap the replacement node with the largest child node, and
repeat step 3.

#### Example: #### Solutions:

[TABS_R id=1602]

[forminator_quiz id=”1608″]