Suppose we maintain a linked list of length n in sorted order.What would be the big-Oh notation for printing out those elements that occur exactly once in the list? A)O(1) B)O(n) C)O(n log n) D)O(n²)

Question

Quizplus · Accepted Answer

We would have to traverse the entire linked list to identify elements that occur exactly once, which would take O(n) time. Printing out these elements would also take O(n) time. Therefore, the overall time complexity would be O(n).

Suppose We Maintain a Linked List of Length N in Sorted