[Solved] What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?

Computer Science Engineering (CSE)
Data Structures (DS)
Linear Data Structures - List
What would be the asymptotic time comple...

Q.	What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?
A.	O(1)
B.	O(n)
C.	O(n2)
D.	O(n3)
Answer» A. O(1)

View all MCQs in: Data Structures (DS)

Discussion

Related Questions

What would be the asymptotic time complexity to insert an element at the second position in the linked list?
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
What would be the asymptotic time complexity to find an element in the linked list?
What is the time complexity of searching for an element in a circular linked list?
What differentiates a circular linked list from a normal linked list?
What is the time complexity to count the number of elements in the linked list?
What is the worst case time complexity of inserting a node in a doubly linked list?
In a linked list the _________field contains the address of next element in the list.
To insert a new node in linked list free node will be available in ___________.
The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?