Explain the priority queue?
- 1 Answers
- 1068 Views
- I also Faced
- E-Mail Answers
Answer / Mahendra Pratap
A Priority Queue is a collection that orders elements based on a specified order, typically using a key associated with each element. Elements with lower (or higher) keys have a higher (or lower) priority, and the queue always maintains its elements in this order. The most common use of a priority queue is in algorithms for solving optimization problems.
| Is This Answer Correct ? | 0 Yes | 0 No |
Is bubble sort faster than selection sort?
What is map entry?
What is the difference between data types and data structures?
How do you sort an array by value?
Write the stack overflow condition.
What is the difference between hashset and treeset?
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
State the properties of a binary tree?
Do you know what is linear search?
What is max heapify?
Which is the simplest file structure?
How many types of priority queue are there?
Windows 
