Every operation taking O(n) time in Linked Lists

[deshwalmahesh]

hi, I think there's a difference between your implementation and the theoratical aspect of Linked List. Deletion and Insertion must take O(n) time where you are looping in O(n) time

[bfaure]

Hi @deshwalmahesh, what you've pointed out is correct. This implementation is inefficient in that sense, but I don't want to change it here and cause confusion between the code in the video tutorial vs. what's stored in the repo.