A priority queue is best-implemented using a: 

A

Stack

B

Linked list 

C

array

D

heap

উত্তরের বিবরণ

img

Answer: ) Heap
A priority queue is an abstract data type where each element has a priority, and the element with the highest (or lowest) priority is served first.

Unfavorite

0

Updated: 2 days ago

Related MCQ

In an array-based implementation of a complete binary tree, what is the index of the left child of a node at index i (assuming zero-based indexing)?


Created: 2 days ago

A

2i

B

2i + 1

C

i + 1

D

i - 1

Unfavorite

0

Updated: 2 days ago

  Which one is not an addressing mode?

Created: 2 days ago

A

Immediate

B

Direct

C

Indirect

D

Sequential

© LXMCQ, Inc. - All Rights Reserved

Developed by WiztecBD