In C++, you need to transpose the linked list, where you move the object in the node that is being searched, one node closer to the head. This allows to decrease the cost as the more often the obj is searched the closer it moves to the head of the list. You have a remove function to remove the node from the linked list. You need to create add to the find function where the parameter is the object that is being searched and will be swapped one node closer to the head. Insert your line of code in the find function where the two helper comments are at the end of the find function.

DList