Question: You are provided with a max heap of 'n' elements with a number 'x' and 'k'...You have to find whether 'k' elements in heap are greater than 'x' or not??
Time Complexity should be O(k)

Solution: Use a DFS kind of approach. Terminate the recursion at a node when the value is less than or equal to 'x'. Keep incrementing the counter during the procedure. As soon as you encounter the value of counter as 'k' return true, else, when the DFS is complete and still counter<'k' return false.