What is a priority queue?
- 1 Answers
- 1055 Views
- I also Faced
- E-Mail Answers
Answer / Siddharth Lohani
A Priority Queue is a data structure that stores elements in such a way that they can be retrieved in order of some priority, with the highest (or lowest) priority item being retrieved first. It follows a principle known as the "first-in-first-out" (FIFO) or "last-in-first-out" (LIFO) principle based on the priority assigned to each element.
| Is This Answer Correct ? | 0 Yes | 0 No |
Is list same as array?
Does arraylist allow null values?
Is heap sort stable?
What is a matrix? Explain its uses with an example
What is a minimum spanning tree?
What is a directed graph?
Can arraylist hold duplicates?
How will you reverse Linked List.
What are the applications of priority queues?
What is the advantage of the heap over a stack?
Define primary data structures?
Define non linear data structure.
Windows 
