Suppose we maintain two linked lists of length n in random element order.What would be the big-Oh notation for the creating a third list that includes only elements common to both lists, without sorting the first two lists? A)O(1) B)O(n) C)O(n log n) D)O(n²)

Question

Quizplus · Accepted Answer

To find common elements between two unsorted linked lists, you need to compare each element of the first list with each element of the second list, resulting in a time complexity of O(n^2).

Suppose We Maintain Two Linked Lists of Length N in Random