For Linked list - as mentioned in video time complexity is o(1) because we were already aware where we need to insert/delete a node. If we don't know the location - we need to traverse entire linked list and time complexity would be o(n).
Thanks paw! Glad that this video connected with you. We've been putting consistent efforts to make these videos so that students can understand the concepts clearly!
For Linked list - as mentioned in video time complexity is o(1) because we were already aware where we need to insert/delete a node.
If we don't know the location - we need to traverse entire linked list and time complexity would be o(n).
Simple and great explanation of the most used optimisation techniques! Thanks for making it interesting and useful!
Thanks paw! Glad that this video connected with you.
We've been putting consistent efforts to make these videos so that students can understand the concepts clearly!
Very good illustration.