Possible Duplicate:
How we can find kth largest element from a max-heap in O(k) time?
There is a given a max-heap, we want to find an algorithm in o(k) time complexity to check if k'th smallest element is bigger than arbitrary given number.
Possible Duplicate:
How we can find kth largest element from a max-heap in O(k) time?
There is a given a max-heap, we want to find an algorithm in o(k) time complexity to check if k'th smallest element is bigger than arbitrary given number.