Which of the following data structures can be used to efficiently implement a…
DSSSB TGT/PGT · 2018 · PGT Computer Science (Male) · 27 Jul 2018 · Shift 2 · Section II: subject
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 1027 students.
Sign up free to check your answer
Sign up freeLoading lesson…