118k views
3 votes
What feature of heaps allows them to be efficiently implemented using a partially filled array?

User Woubuc
by
8.1k points

1 Answer

4 votes
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.
User PeakJi
by
7.6k points
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.