Question : Write a c++ program which creates a Linked List having maximum sum out of two Sorted Linked Lists. For eg: You have two sorted linked lists, create a linked list that contains data with...

Question :
Write a c++ program which creates a Linked List having maximum sum out of two Sorted Linked Lists.


For eg:
You have two sorted linked lists, create a linked list that contains data with maximum sum. The resulting list with maximum sum will contain nodes with data from both input sorted lists. While creating the resulting list with maximum sum, we may switch to the other input list only at the point of intersection (which mean the two nodes with the same value in the lists). You are only allowed to use O(1) extra space.

Input:

List1 = 1->3->30->90->120->240->511
List2 = 0->3->12->32->90->125->240->249

Output:

Following is resulting linked list out of two sorted lists
ResultingList = 1->3->12->32->90->125->240->511