Which of the following data structures can be used to efficiently implement a…
DSSSB 2018
Which of the following data structures can be used to efficiently implement a priority queue?
- A.
Array
- B.
Single Linked List
- C.
Circular Linked List
- D.
Heap Tree
Attempted by 2092 students.
Sign up free to check your answer
Sign up freeLoading lesson…

