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?

  1. A.

    Array

  2. B.

    Single Linked List

  3. C.

    Circular Linked List

  4. D.

    Heap Tree

Attempted by 1027 students.

Sign up free to check your answer

Sign up free

Explore the full course: Rssb Senior Computer Instructor

Loading lesson…