Ask Question
8 May, 21:05

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

+2
Answers (1)
  1. 8 May, 23:06
    0
    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.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “What feature of heaps allows them to be efficiently implemented using a partially filled array? ...” in 📘 Business if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers