00:02
All right, so for this question, we are asked what is the, what would be the time complexity? if a user tries to insert, you know, an element into a linked list, which is singly linked.
00:18
So it's linked only going forward, not going backwards.
00:22
So you have a next reference, but you don't have a previous reference.
00:27
So the way we would approach this is, so first, let's see.
00:32
Let's just write out a simple link list which contains integers and only a single next reference.
00:41
So let's just say this linked list has three nodes and that's the end.
00:47
So what would be the time complexity if we try to insert an element at the end? so we try to insert an element right here...