![]() ![]() Priority queue can be implemented using an array, a linked list, a heap data structure, or a binary search tree. The element with the highest priority is removed first. In a queue, the first-in-first-out rule is implemented whereas, in a priority queue, the values are removed on the basis of priority. Removing Highest Priority Elementĭifference between Priority Queue and Normal Queue We can also set priorities according to our needs. However, in other cases, we can assume the element with the lowest value as the highest priority element. The element with the highest value is considered the highest priority element. Generally, the value of the element itself is considered for assigning the priority. However, if elements with the same priority occur, they are served according to their order in the queue. That is, higher priority elements are served first. And, elements are served on the basis of their priority.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |