Which of the following data structures can be used to efficiently implement a…

2018

Which of the following data structures can be used to efficiently implement a priority queue?

Answer: D. Heap Tree

  1. A.

    Array

  2. B.

    Single Linked List

  3. C.

    Circular Linked List

  4. D.

    Heap Tree

Attempted by 820 students.

Show answer & explanation

Correct answer: D

Explore the full course: Up Lt Grade Assistant Teacher 2025

Loading lesson…