int searchHeap(int x)

{/* search for x in the heap 
   Time if 0(n) since heaps aren't
  organized for searching */
  int i;
  for (i=1; i<=n; i++)
    if (heap[i].key == x) return i;
  return 0;
}