Sorted insert in a doubly linked list with head and tail pointers
A Doubly linked list is a linked list that consists of a set of sequentially linked records called nodes. Each node contains two fields that are references to the previous and to the next node in the sequence of nodes.
The task is to create a doubly linked list by inserting nodes such that list remains in ascending order on printing from left to right. Also, we need to maintain two pointers, head (points to first node) and tail (points to last node).
Input : 40 50 10 45 90 100 95 Output :10 40 45 50 90 95 100 Input : 30 10 50 43 56 12 Output :10 12 30 43 50 56
The task can be accomplished as:
- If Linked list is empty then make both the left and right pointers point to the node to be inserted and make its previous and next field point to NULL.
- If node to be inserted has value less than the value of first node of linked list then connect that node from previous field of first node.
- If node to be inserted has value more than the value of last node of linked list then connect that node from next field of last node.
- If node to be inserted has value in between the value of first and last node, then check for appropriate position and make connections.
Doubly linked list on printing from left to right 10 23 30 40 50 60 90 95 110
Time complexity: O(n) since using a single loop to traverse doubly linked list
Auxiliary Space: O(1)