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
- A.
Array
- B.
Single Linked List
- C.
Circular Linked List
- D.
Heap Tree
Attempted by 819 students.
Show answer & explanation
Correct answer: D
Loading lesson…