Merging the ordered Singly Linked List for Data Structure in 'C'

February 28, 2014 0 Comments

Merging the ordered Singly Linked List:

         Often it is necessary to merge two linked lists into a single linked list. Merging of two arrays consumes lots of time and storage whereas merging of two linked lists is simple. Just changing the address stored in link field of each node as and when required carries out the merging in case of linked list. Let us consider the example as follows before dealing with algorithm and program.

Both of the linked lists are in ascending order. First node address of each linked list is stored in ROOT1 and ROOT2 respectively. In order to merge these lists we can use another external pointer ‘ROOT’ to point to the first node of each list is compare. The node whose information is less become the first node of the merged list and the address of that node is stored in ‘ROOT’ .The process is continued till the end of each list.
In the above example the information of the first node of the second list is smaller than that of first node of the first linked list. So, ROOT is assigned with ROOT2 and ROOT2 is updated to point to the next node of the second linked list . Now ROOT2 points to a node with information 23.

Jackrin Reacher

Some say he’s half man half fish, others say he’s more of a seventy/thirty split. Either way he’s a fishy bastard. Google