In this tutorial you will learn about the Difference Between Singly Linked List vs Doubly Linked List and its application with practical example.
Difference Between Singly Linked List vs Doubly Linked List
What Is Singly Linked List?
It is the one of the variation of linked list in which operations of data items and elements are performed or executed in one way direction and it is defined for the storing of that object that further called as nodes and can be stored in memory randomly , there are two fields in singly linked list one is called where these data stores and the second is called pointer and these both link with the data to address them properly. Insertion, deletion and transversal operations are performed in singly linked list.
What Is Singly Doubly List?
In this type of linked list there are two links are present for each node where the operation of storing data items and elements are performed, here first link points the node of previous list and second link points the next node present in it, and the navigation is possible from both side and the last part is linked for the previous pointer it is more complex then singly linked list
Singly Linked List vs Doubly Linked List In Data Structure
| SINGLY LINKED LIST | DOUBLY LINKED LIST |
| Here each node contains the data of next node which is linked | Here each node contains the data of previous and next node which is linked |
| Due to only forward operation transversal process cannot be performed | Transversal process can be performed with this benefit |
| It uses the memory for each node | It use more then normal memory for each node |
| O(n) position is used to address the complexity of insertion and deletion | O(1) position is used to address the complexity of insertion and deletion |
| When searching is not performed and have to save the memory then this list is used | When there is no boundation for memory consumption and better dynamic performance is needed then this list is used |
| Transverse is performed whether the element is present in the list in the last position | Transverse is performed in the end of the list whether the element is anywhere in the list |
| It is highly used in developing of stacks | It is used in heap ,binary trees and stacks |
