A priority queue is best-implemented using a:

A priority queue is best-implemented using a:

  1. a) Stack
  2. b) Linked list
  3. c) array
  4. d) heap

From the BCS Technical Cadre (CSE) October 2025 – 49th BCS Written (Special) (BPSC) exam, question 86 of 123.

More from this paper