Question

Difference between singly linked list and doubly linked list in tabular form

Answer 1

each node in the singly list stores the contents and a pointer or reference to the next node in the list. It does not store any pointer or reference to the previous node.

Properties

singly linked list is single directional

It uses less memory per node (single pointer)

Complexity of insertion and deletion at a known position is O(n)

while A doubly linked list is a list that contains links to next and previous nodes. Unlike singly. linked lists where traversal is only one way, doubly linked lists allow traversals in both. ways.

Properties

doubly linked list is bidirectional i.e can move backward as well as forth.

It uses more memory per node(two pointers)

Complexity of insertion and deletion at a known position is O(1)

images of singly linked list and doubly linked list in tabular form are shown in attached files