What will trigger a worst time search for a binary heap and what is the run time?
Heaps are maintained so that they are always balanced. A heap containing $n$ elements will have height $O(\log n)$. All operations on heaps take time linear in the height.