Check this out

Linked lists are a data structure that is dynamic, assigning the required storage when the program is started.
Insertion and deletion node operations are often implemented in a linked list.
Linear information structures such as stacks and queues are often executed with a linked-list.
Entry time can be reduced by them and may enlarge in actual moment without storage expense.

They have an inclination to squander extra storage space being due to pointers required by memory.
Nodes in a linked-list must be read in order from the beginning as linked lists are access that is fundamentally sequential.
Nodes are stored incontiguously, greatly increasing the time demanded to get individual components within the list.
Difficulties appear in linked lists when it comes to reverse crossing. Singly linked lists are not exceptionally easy to navigate backwards, and memory is wasted in assigning space for a rear tip while doubly linked lists are fairly simpler to read.