Summary
| Data Structure Name | Queue |
| Type | Linear Data Structure |
| Tagline | FIFO – First In First Out |
| Operations | Enqueue Dequeue |
| Use cases | |
| Implementations |      |
Definition
Queue follows the FIFO – First In First Out principle, so the item which is inserted at first, will go out first. Elements are added to the back of the queue and pulled out from the front of the queue.
Use Cases
Characteristics
Elements
A Linked List data structure has the following info-
- Head
- Tail
- Length
Each node has the following info-
NOTES
Types
Functionality
Code Implementations
Use the following links to check Queue data structure implementation in specific programming languages.