You are given the array representation of a binary maxheap c

You are given the array representation of a binary max-heap containing n elements, and a real number x. Design an O(k) time algorithm to determine if the k^th largest element in the heap is less than or equal to x.

Solution

To solve this problem, we need to use depth first search. The intution is to search

Following is the recursive solution: