Linked list is a very common data structure. It can be used to implement lists, stacks, queues etc.
The most obvious feature of it is that it is easy to remove or insert, but not efficient to travesal.
The simplest structure of linked list is singly linked list. It contains two part in one node or called element, data and reference(or link). A linked list consists of multilple nodes. They are not continous in physical memory placement. So, it will be more convient to insert or remove one item at random position. And there's no need to reallocate or reorganize the structure again.