If debugging is the process of removing software bugs, then programming must be the process of putting them in. Edsger Dijkstra

Merge a linked list

Language Java | Level Intermediate | Category Data structure | September 5, 2015 11:07 pm


Data structure Description

Merge two linked lists into one list and return the head node. The second linked list head node link with first linked list tail node. The utility function should return the head node of merged linked list and print the data values.


Output

   					 

Print the list of items: 1->2->3->4->NULL
Print the list of items: 5->6->7->8->NULL
Print the list of items after pairwise Swap: 1->2->3->4->5->6->7->8->NULL

				    

Comments


No comments available!

Please login to add comments.