Advantages of Linked List
- The linked list is a dynamic data structure.
- You can also decrease and increase the linked list at run-time. That is, you can allocate and deallocate memory at run-time itself.
- In this, you can easily do insertion and deletion functions. That is, you can easily insert and delete the node.
- Memory is well utilized in the linked list. Because in it, we do not have to allocate memory in advance.
- Its access time is very fast, and it can be accessed at a certain time without memory overhead.
- You can easily implement linear data structures using the linked list like a stack, queue.
Disadvantages of 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.
- It is very difficult to traverse the nodes in a linked list. In this, we cannot access randomly to any one node. (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.
- Reverse traversing in a linked list is very difficult, because it requires more memory for the pointer.
Application of Linked List
The linked list is a primitive data structure, which is used in various types of applications.
- It is used to maintain directory names.
- The linked list can perform arithmetic operations in the long integer.
- Polynomials can be manipulated by storing constant in the node of the linked list.
- We can also use it to next and previous images in the image viewer.
- With the help of the linked list, we can move songs back and forth in the music player.
- The linked list is also used for undo in word and Photoshop applications.
- All the running applications in the computer are stored in the circular linked list, and the operating system provides them with a fixed time slot.
- It can also be used to implement hash tables.
Difference between linked list and array
Both array and linked list are used to store the same type of linear data, but array is allocated contiguous memory location in the compile-time while the linked list is allocated memory in run-time.
|It is a collection of the same type of data type.||It is a collection of similar elements that are connected to each other by the pointers.|
|It supports random access, which means that we can access it directly using its index, like arr for 1st element, arr for the 8th element, etc.||It supports sequential-access, meaning that in order to use any node in it, the user must traverse the whole list sequentially.|
|In the array, elements are stored in the contiguous-memory location.||The elements in the linked list can be stored anywhere in memory.|
|The time complexity of the array is O (1).||The time complexity of the linked list is O (n).|
|It is allocated the memory at compile-time.||It is allocated the memory at run-time.|
|Arrays take longer to perform insertion and deletion functions than linked lists.||In the linked list, both insertion and deletion operations take less time than the array.|
|It can be a 1-d array, 2-d array, or 3-d array.||It can be a linear linked list, doubly linked list, or circular linked list.|