engineering computer science MCQ #1263

Which data structure is suitable for implementing a priority queue?

engineering computer science MCQ #1263

  1. Question 1

    Q1. Which data structure is suitable for implementing a priority queue?

    • A) Stack
    • B) Queue
    • C) Heap
    • D) Tree

    Answer: Heap

    Explanation: A heap is a suitable data structure for implementing a priority queue, as it allows for efficient insertion and removal of elements based on priority.