The Gateway to Computer Science Excellence
0 votes
513 views

What is the most appropriate data structure to implement a priority queue ?

  1. Heap
  2. Circular array
  3. Linked list
  4. Binary tree
in DS by Boss (30.8k points)
recategorized by | 513 views
+1

Heap is the best implementation of Priority Queue.

Read this  and this

1 Answer

0 votes
option A HEAP
by Loyal (6.9k points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,356 answers
198,482 comments
105,252 users