5.7SUMMARY
•A queue is a linear collection of data elements in which the element inserted first will be the element taken out first (i.e., a queue is a FIFO data structure).
•A queue is a linear data structure in which the first element is inserted from one end, called the REAR end, and the deletion of the element takes place from the other end, called the FRONT end.
•The implementation of queues can be done in two ways: implementations through arrays/lists and implementations through linked lists.
•Insertion and deletion are the two basic operations that are performed on queues.
•A circular queue is a linear data structure in which the operations are performed based on a FIFO (First In, First Out) principle, and the first index comes after the last index.
•A priority queue is a queue in which elements are processed based on the assigned priority. Each element in a priority queue is assigned a special value called the priority of the element...
