Q1. Write an algorithm and program in 'C' language to merge two sorted linked lists. The resultant linked list should be sorted.
Key Points:
- Merging two sorted linked lists creates a new sorted list.
- The algorithm compares head nodes, appending the smaller to a result list.
- A dummy head node simplifies handling the first element of the merged list.
- Pointers are rearranged, not new data nodes created, for efficiency.
Answer: Merging two sorted linked lists efficiently is a fundamental operation in data structures, often encountered in algorithms like merge sort. The objective is to combine two already sorted lists into a single new list that remains sorted, without using extra space for new data elements, but by rearranging pointers. This technique is extensively discussed in units covering linked list manipulation and sorting in the MCSL-209 course material. ### Algorithm to Merge Two Sorted Linked Lists The al...