is it possible to find the nodes larger than k in a min max heap in O(m) time, given m is the number of nodes larger than k.

if it is possible then how do i implement the rest of the standard heap procedures in standard time (insert and delete, extract min and extract max is easy obviously)