title: Find all keys smaller than x in an array min-heap
body: <p>Can some one describe an algorithm that finds all keys smaller than x in an array implementation of a min-heap.
  I want the running time to be at least O(k) where k is the number of keys reported.</p>
  
  <p>I've been scratching my head for a while now with this.</p>