Which feature of heaps allows them to be efficienty implemented using an array?

Heaps are complete binary trees
  • Heaps are binary trees
  • Heaps are binary search trees
  • Heaps are full binary trees

A heap is not a BST.

In general, just being a binary tree (or even a full binary tree) is not enough to let something be implemented using an array.