How to merge two sorted linked lists? Explain? Write an algorithm to merge two sorted linked lists?
Fantastic news! We've Found the answer you've been seeking!
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
1->2->5->6->7->8->NULL
Output: Linked lists should be merged to,
1->2->3->4->5->6->7->8->NULL
Expert Answer:
Merge two sorted linked lists 1 Create a dummy node that will be the head of the merged list 2 Initi... View the full answer
Related Book For 
Computer Organization and Design The Hardware Software Interface
ISBN: 978-0124077263
5th edition
Authors: David A. Patterson, John L. Hennessy
Posted Date:
