the main advantages of singly linked list are:
1) Singly linked list can store data in non-contiguous locations. Thus there is no need of compaction of memory, when some large related data is to be stored into the memory.
2) Insertion and deletion of values is easier as compared to array, as no shifting of values is involved.
Apart from these advantages, there are some disadvantages also. These are:
1) Nodes can only be accessed sequentially. That means, we cannot jump to a particular node directly.
2) Because of the above disadvantage, binary search algorithm cannot be implemented on the Singly linked list.
3) There is no way to go back from one node to previous one. Only forward traversal is possible.
1) Singly linked list can store data in non-contiguous locations. Thus there is no need of compaction of memory, when some large related data is to be stored into the memory.
2) Insertion and deletion of values is easier as compared to array, as no shifting of values is involved.
Apart from these advantages, there are some disadvantages also. These are:
1) Nodes can only be accessed sequentially. That means, we cannot jump to a particular node directly.
2) Because of the above disadvantage, binary search algorithm cannot be implemented on the Singly linked list.
3) There is no way to go back from one node to previous one. Only forward traversal is possible.
Tags:
data structures