Question: Question 1 : Write an algorithm to merge two Singly Linked Lists. Assume that the data in each list are in ascending order. The algorithm
Question :
Write an algorithm to merge two Singly Linked Lists. Assume that the data in each list are in ascending order. The algorithm should return a one Singly Linked List, containing all the data in ascendings order.
For example, if the lists are:
and
After the merge, the result is:
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
