![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656309074339-Article%20%281%29%20img.jpg\")
<\/p>\n<\/p>\n
A Queue is a linear data structure. Queue follows the FIFO rule i.e. First in First out. In other words we can say the element that goes in first is the element that comes out first.
\nFor Example A ticket Queue outside a cinema hall where the person enters the queue first will get the ticket first.<\/p>\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656308918940-Image-01.png\")
<\/p>\n
Given below are the operations of the queue:<\/p>\n
Enqueue:<\/strong> This function is used to add an element to the rear end of the queue. If the queue is completely filled, then it will be in an overflow condition. The time complexity of the enqueue is O(1).<\/p>\n<\/li>\n Dequeue:<\/strong> This function is used to remove an element from the front end of the queue. If the queue is empty, then it will be in an underflow condition. The time complexity of the dequeue is O(1).<\/p>\n<\/li>\n Front:<\/strong> This function returns the front element of the queue. The time complexity of this function is O(1).<\/p>\n<\/li>\n Rear:<\/strong> This function returns the last element of the queue. The time complexity of this function is O(1).<\/p>\n<\/li>\n Peek():<\/strong> This operation is used to get the value of the element from the front of the queue.<\/p>\n<\/li>\n<\/ul>\n Linked list is a linear data structure just like arrays. In the linked list the elements are not stored in contiguous locations, the elements are connected or linked using pointers. Each node stores the data and the address of the next node.<\/p>\nLinked List:<\/h3>\n
\n
Linked List Representation:<\/h3>\n\t\t\t\t\t\t