UTpaper

Free mock tests & test series

Question 150

A priority queue is most efficiently implemented using a:

  1. ALinked list without order
  2. BStack
  3. CSimple queue
  4. DHeap
Show answerHide answer

Correct answer: (D) Heap

Explanation

Insert and delete-max/min take O(log n).

From DSSSB TGT Computer Science Full Mock Test 5

This is question 150 of DSSSB TGT Computer Science Full Mock Test 5. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.