Example of worst case input for Build-Max-Heap What would be an example of a worst-case input for Build-Max-Heap?  What would the "shape" of it "look like"?  I'm having trouble getting a feeling for it.
Think of a heap as a tree, not its array implementation.

Building a heap work bottom-up. Working from the lowest levels up to the root we add the keys one by one. Worst case is when each key moves as much as possible, so all the way to the level of leaves. 

This should start getting the picture.