I was revising my concepts using your videos and then I got curious if you are still posting today. I’m so glad that after 5 years you’re back! I have my Algorithms practical exam tomorrow and your videos are helping me a lot. Thank you.
Nice video, please could you explain the red-black tree deletion operation, it was the only thing you didn't explain 5 years ago when you talked about red black trees
Each object has data and a pointer to the next object in the list. - Linked lists are used to implement other data structures and in dynamic memory allocation. - Common operations with linked lists include search, insert, and delete. - Search has a time complexity of O(n), while insert and delete have a constant time complexity of O(1).
