Suppose we maintain two linked lists of length n in sorted order. What would be the big-Oh notation for the creating a third list, which included only elements common to both lists? A) O(1) B) O(n) C) O(n log₂n) D) O(n²)

Question

Quizplus · Accepted Answer

To find common elements in two sorted linked lists, you can traverse both lists simultaneously, which takes linear time, O(n).

Suppose We Maintain Two Linked Lists of Length N in Sorted