Question

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)

Answer 1

Right option is (a) O(1)

For explanation: A new node is created with the required element. The pointer of the new node points the node to which the head node of the linked list is also pointing. The head node pointer is changed and it points to the new node which we created earlier. The entire process completes in O (1) time. Thus the asymptotic time complexity to insert an element in the second position of the linked list is O (1).