Every practical container implementation allows sequential access. Sequential access means that one can iterate over the elements of the container, accessing them one after another in a sequence. Lists, trees, and graphs are examples of data structures that support sequential access.
Lists can be further categorized based on where new elements can be inserted: at the beginning (stack or LIFO list), at the end (queue or FIFO list), or in the middle at an arbitrary position (linked list). Stacks operate on a Last In First Out (LIFO) basis, while queues follow a First In First Out (FIFO) order.
[
add
]
[
|
|
...
]