├── README.md ├── queue-using-doubly-linked-list.zip └── queue-using-linked-list2.zip /README.md: -------------------------------------------------------------------------------- 1 | # Queue 2 | 3 | A queue is a linear data structure that follows the First In, First Out (FIFO) principle. The main operations on a queue are: 4 | 5 | **Enqueue:** Adds an element to the rear of the queue. 6 | 7 | **Dequeue:** Removes and returns the element from the front of the queue. 8 | 9 | **Front:** Returns the element at the front of the queue without removing it. 10 | 11 | **isEmpty:** Checks if the queue is empty. 12 | -------------------------------------------------------------------------------- /queue-using-doubly-linked-list.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Queue-Data-Structure/c1047e6b71c9eb5d21bed8ffaa97e5a43e7af2c8/queue-using-doubly-linked-list.zip -------------------------------------------------------------------------------- /queue-using-linked-list2.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Queue-Data-Structure/c1047e6b71c9eb5d21bed8ffaa97e5a43e7af2c8/queue-using-linked-list2.zip --------------------------------------------------------------------------------