Linear data structures maintain their data in an ordered fashion. Linked Lists are collections of items where each item holds a relative position. A linked list implementation maintains logical order without requiring physical storage requirements.
They are often used to implement abstract data types like queues and stacks and are very efficient at insertion and deletion!
We are going to be looking at: