An array like data structure, whose element follow the FIFO(Last In First Out) rule
- Enqueue
- The element is pushed at the end of the queue
- Dequeue
- The element is removed from the front of the queue
- peep
- To find n th element from queue.
| Operation | Complexity |
|---|---|
| Enqueue an element | O(1) |
| Dequeue an element | O(1) |
| Peek an element at front of the queue | O(1) |
| Search an element | O(n) |
- Doubly Linked List
