Assuming the priority queue is implemented as a heap, the first step is to insert the new element in the ____ available position in the list.
A) smallest
B) largest
C) first
D) last

Question

Quizplus · Accepted Answer

The Answer of Assuming the priority queue is implemented as a heap, the first step is to insert the new element in the ____ available position in the list.
A) smallest
B) largest
C) first
D) last

Assuming the Priority Queue Is Implemented as a Heap, the First