![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656063376878-Article.jpg\")
<\/p>\n<\/p>\n
The queue is a linear data structure that works on the principle of First in First out (FIFO). In the queue, the element which is added at least recently is removed first from it. For example, a queue of consumers for a resource or service where the consumer who comes first will be served first.<\/p>\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656063394897-Image-01%20%281%29.png\")
<\/p>\n
Given below are the operations of the queue:<\/strong><\/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 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 Front:<\/strong> This function returns the front element of the queue. The time complexity of this function is O(1).<\/p>\n Rear:<\/strong> This function returns the last element of the queue. The time complexity of this function is O(1).<\/p>\n There are many ways to implement a queue in python. Given below are the different ways to implement a queue in python:<\/p>\n The list is a built-in data structure in python that can be used as a queue. In place of enqueue() and dequeue(), there are append() and pop() functions. However, using the list in the implementation is a quite slow process, as inserting or deleting an item from the beginning requires shifting all of the other elements by one which is having O(N) time complexity.<\/p>\nImplementation of Queue in Python<\/h3>\n
\n
Implementation using list<\/h3>\n
Code Implementation<\/h4>\n\t\t\t\t\t\t