Linked List

Inserting a new item is very fast //O(1)

Searching is sequential //O(N)

Removing an item is fast because of the references