ObjectiveMCQ
Print Protected
This page is protected for print. Use the website to view the content.
In a singly linked list, what is the time complexity to insert a node at the beginning?
Correct Answer: A — A: O(1)
Inserting at the beginning takes constant time O(1) as we only update the head pointer.