Question: How to merge two sorted linked lists? Explain? Write an algorithm to merge two sorted linked lists? Input : Head of following linked lists 1->2->3->4->NULL
How to merge two sorted linked lists? Explain? Write an algorithm to merge two sorted linked lists?
Input: Head of following linked lists
1->2->3->4->NULL
1->2->5->6->7->8->NULL
Output: Linked lists should be merged to,
1->2->3->4->5->6->7->8->NULL
Step by Step Solution
3.42 Rating (165 Votes )
There are 3 Steps involved in it
Merge two sorted linked lists 1 Create a dummy node that will be the head of the merged list 2 Initi... View full answer
Get step-by-step solutions from verified subject matter experts
