(As we do in the array by index.) For example: - If we want to traverse a node in an n position, then we have to traverse all the nodes that come before n, which will spoil a lot of our time. In this, we cannot access randomly to any one node.
It is very difficult to traverse the nodes in a linked list.The linked list requires more memory to store the elements than an array, because each node of the linked list points a pointer, due to which it requires more memory.You can easily implement linear data structures using the linked list like a stack, queue.Its access time is very fast, and it can be accessed at a certain time without memory overhead.Because in it, we do not have to allocate memory in advance. Memory is well utilized in the linked list.That is, you can easily insert and delete the node. In this, you can easily do insertion and deletion functions.
That is, you can allocate and deallocate memory at run-time itself.