Here you will learn about advantages and disadvantages of linked list.
It is a data structure in which elements are linked using pointers. A node represents an element in linked list which have some data and a pointer pointing to next node. Its structure looks like as shown in below image.
There are various merits and demerits of linked list that I have shared below.
Advantages and Disadvantages of Linked List
Advantages of Linked List
Dynamic Data Structure
Linked list is a dynamic data structure so it can grow and shrink at runtime by allocating and deallocating memeory. So there is no need to give initial size of linked list.
Insertion and Deletion
Insertion and deletion of nodes are really easier. Unlike array here we don’t have to shift elements after insertion or deletion of an element. In linked list we just have to update the address present in next pointer of a node.
No Memory Wastage
As size of linked list can increase or decrease at run time so there is no memory wastage. In case of array there is lot of memory wastage, like if we declare an array of size 10 and store only 6 elements in it then space of 4 elements are wasted. There is no such problem in linked list as memory is allocated only when required.
Implementation
Data structures such as stack and queues can be easily implemented using linked list.
Disadvantages of Linked List
Memory Usage
More memory is required to store elements in linked list as compared to array. Because in linked list each node contains a pointer and it requires extra memory for itself.
Traversal
Elements or nodes traversal is difficult in linked list. We can not randomly access any element as we do in array by index. For example if we want to access a node at position n then we have to traverse all the nodes before it. So, time required to access a node is large.
Reverse Traversing
In linked list reverse traversing is really difficult. In case of doubly linked list its easier but extra memory is required for back pointer hence wastage of memory.
Video Tutorial
If you know some other advantages and disadvantages of linked list then please mention by commenting below.
Please can I know how to insert and delete an element in linked list in an easier manner
Jophadpatti question is that?
Its too easy if u want to know cantact to me
yup it’s possible
in case of deletion :
wehave to remove the address the address of that node from previous node(address field and update the address of next node.
ghhere we are using and pointer variable *ptr and holds the address of that node which we want to delete
in case of nsertion :
just put the address of that node in the previous node
Please can you teach us nodes and its complexity in data structure?
Thank you sir,for this explanation,
THANKS FOR THE INFORMATION , IT HAS REALLY HELPED ME UNDERSTAND MORE ABOUT LINKED LISTS. KEEP UP THE SPIRIT OF SHARING THE KNOWLEDGE.
thanks for this info
Thank you ..sir …for the information..
tq for the information dute
how is linked list very effective in java
Nice info helped me a lot
Thank you sir it really helps me ..!!!
I want to check program of c + +
Binary search cannot be applied in a linked list
It is not easy to sort the elements stored in the linear linked list.
Usefull
value able and knowledgeable article and i think that an other advantage of linked list is to update list size at any time where we need ( updating of list).
Please send me types of linked list and advantages and disadvantages for each one type