What would be the asymptotic time complexity to insert an element at the second position in the linked list?
(a) O(1)
(b) O(n)
(c) O(n^2)
(d) O(n^3)
My question is based upon Singly Linked List Operations topic in division Abstract Data Types of Data Structures & Algorithms I
This question was addressed to me in class test.