Which data structure is the best for implementing a priority queue?

BPSC TRE · TRE 2.0 · TGT (Classes 9–10) · Computer · 8 Dec 2023 · Single shift · Subject

Which data structure is the best for implementing a priority queue?

  1. A.

    Linked list

  2. B.

    Array

  3. C.

    Binary heap

  4. D.

    B-Tree

  5. E.

    None of the above

Attempted by 961 students.

Sign up free to check your answer

Sign up free

Explore the full course: Rssb Senior Computer Instructor

Loading lesson…