What feature of heaps allows them to be efficiently implemented using a partially filled array?

The answer is " Heaps are complete binary trees".

In software engineering, a heap is a particular tree-based information structure that fulfills the heap property. The heap is one maximally effective execution of a dynamic information sort called a priority queues, and in reality priority queues are regularly alluded to as "heaps", regardless of how they might be implemented.