What would be the asymptotic time complexity to find an element in the linked list? *
1
O(1)
O(n)
O(n2)
O(n4)
Other:
Answers
Answered by
0
Answer:
Explanation: To add an element at the front of the linked list, we will create a new node which holds the data to be added to the linked list and pointer which points to head position in the linked list. The entire thing happens within O (1) time. Thus the asymptotic time complexity is O (1).
Answered by
0
Answer:
O(1) is the answer.
Explanation:
follow me
Similar questions