979 views
0 votes
0 votes

I think it should be O(L).

1 Answer

Related questions

1 votes
1 votes
1 answer
1
5 votes
5 votes
1 answer
2
hacker16 asked Nov 14, 2017
3,428 views
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?O(n)O(1)θ(n2)θ...