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?

  1. A.

    Array

  2. B.

    Single Linked List

  3. C.

    Circular Linked List

  4. D.

    Heap Tree

Attempted by 2092 students.

Sign up free to check your answer

Sign up free

Explore the full course: Up Lt Grade Assistant Teacher 2025

Loading lesson…