Complexity for the inserion?

#1

Please do tell the complexity of this code
and is there any other approach that could be faster?

#2

hi @Bhavuk_09 from the head you need to go till the last node each time, so the complexity will be O(n) where n is the number of nodes in the list

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.