FIFO
Queue
A linear collection following the First-In-First-Out (FIFO) principle, supporting operations like enqueue and dequeue, useful in task scheduling.
- Time complexity for access and search is Linear, i.e. O(n)
- Time complexity for insertion and deletion is Constant, i.e. O(n)
- Space complexity is Linear