Check this out

Connected lists are an information structure that is dynamic, assigning the required storage when the application is initiated.
Deletion and insertion node functions are often executed in a linked-list.
Linear information structures such as stacks and queues are often executed with a linked-list.
They might expand in real moment without memory overhead and can reduce entry period.

They have a propensity to waste memory due to pointers necessitating additional space for storage.
Nodes in a linked-list should be read from the beginning as linked databases are naturally sequential access.
Nodes are saved incontiguously, greatly increasing the period demanded to access individual elements within the listing.
Problems arise in linked databases when it comes to turn bridging. Singly linked lists are exceptionally difficult to navigate backwards, although doubly linked lists are fairly easier to read, storage is wasted in allocating room for a rear suggestion.