Waiting for answer This question has not been answered yet. You can hire a professional tutor to get the answer.
QUESTION
Given two linked lists sorted in increasing order, write a method intersection( ) to return a new list representing the intersection of the two lists. The new list should be made with its own memory —
Given two linked lists sorted in increasing order, write a method intersection( ) to return a new list
representing the intersection of the two lists. The new list should be made with its own memory — the
original lists should not be changed.
Example: if list1 contains {3,4,7,9,11} and list contains {2,3,8,9,12,15} so the intersection list3 is {3,9}.
