Question: C++ *PLEASE INCLUDE SCREENSHOTS OF YOUR CODE WORKING* Write the code for the function getIntersection below, that given two sorted linked lists returns a linked

C++ *PLEASE INCLUDE SCREENSHOTS OF YOUR CODE WORKING*

Write the code for the function getIntersection below, that given two sorted linked lists returns a linked list that is an intersection of them. Assume that these linked lists are implemented by the class IntList with the interface from Problem 2.

IntList& getIntersection(IntList& intList1, IntList& intList2) {

// TODO: you code here

}

Estimate the big-O complexity of your implementation.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

The question is incomplete as it asks to include screenshots ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!