Tag: data structures

Priority Queue is similar to queue data structure, but in this when we insert an element means when we enqueue an element we also enqueue an additional piece of information, namely priority.

Circular queue is modified version of Queue data structure, that adheres FIFO principle. It has fixed memory size, due to which it permits better memory utilization compare to simple queue.

Queue in Data Structure is a list in which elements have a linear data structure where items get inserted from one end and deleted from another end. Insertion end is considered as rear and deletion end is considered as front end of queue.