How does a doubly-linked list differ from a singly linked one?
Explanation
Difference between Singly and Doubly Linked List
Singly Linked List
Doubly Linked List
Allow one way travel- can access successor
Allows two way travel using two pointers next and previous
Uses less memory per node
Uses more memory per node than singly linked list
Complexity of insertion and deletion at known position is O (n)
Complexity of Insertion and Deletion at known position is O (1) .
There is a allowing delete from a singly-linked list in O (1) , but the list must be circular
Used in places where singly-linked lists would not work but they require slightly more “housekeeping” , and are slightly less efficient on insertions as the result