Question: In C++ Other than the basic linked list data members and operations. Implement a new method which merge two sorted linked lists and return it
In C++
Other than the basic linked list data members and operations. Implement a new method which merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
Example:
Example:
Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
