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.
I just want to say that your strategy for allocating time for things is amazing. It perfectly balances allowing me to either pause or scale up by 0.05x speed
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).
Just wanted to say thank you. Your videos on the sorting algorithms helped me pass the test I needed to take to officially enter my major.
You're welcome! That's awesome. Glad I could be a part of your journey.
Did you graduate?
is anyone else really annoyed that self.head is serving as an node object AND a pointer? that's just confusing lol
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.
The day i wrote my algorithms and data structure exam, you started posting videos again, after 5 years
I just want to say that your strategy for allocating time for things is amazing. It perfectly balances allowing me to either pause or scale up by 0.05x speed
love to hear that, thanks!
Your videos have absolutely carried me through my comp science course. Absolute legend.
Michael Sambol, you are a legend my friend.
Welcome back my hero, I'm understanding everything thanks to your video.
Thanks for coming back to TH-cam and making more videos!
Thank you again for startig these series. Hope everything is good with you!
The man came back!
Thank you so so much
The man, the myth, the legend. Great to see your videos again!
Thank you so much! A video on dynamic programming and greedy algorithms would be amazing
Added to my list..!
please add it in a stack so that when ever you pop it it's first 😇@@MichaelSambol
OMG you are back!
thank you Michael!
bro keep going we going to support u all the way!!
Thank you, Ali! More in the works.
Welcome back man, almost finishing my computer science degree and u decide to finally post again lol
Will you make video on removing nodes from red-black tree?
animation is extremely helpful for understaand the code, even thoughthis is list first time I learn linked list.
How this video has so few views? Your explanation was great, made me understand :)
Straight to the point 🎯
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
On my list... it's a hard video to make but I will get it done.
Thank you for your amazing videos!
Welcome Back 🔥🔥🔥❤️😊
Need more video on data structure topic bro , waiting
3blue1brown of data structure, Thank you
what is the difference between the key and the data of the node?
and thank you great video
The data is the value that the node holds. The key is just the node itself
Please make vedio on topological sorting
Added to my list..
Thats the first time i hear them called singly and doubly. I only ever hear single and double linked list..
- Linked lists are a data structure for storing objects in linear order.
-
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).
if the linked lsit is empty doesn't the head pointer points to the tail?
Head points to nil: github.com/msambol/dsa/blob/master/data_structures/linked_list.py#L12
Can you do binary search in linked list?
Whenever I wrote complete code why I can’t get result after run ?
Try using this as an example: github.com/msambol/dsa/blob/master/data_structures/linked_list.py
@@MichaelSambol thank you 🙏
Please, could you do videos on AVL trees ? Like the ones on r&b ? 😇
Added to the list..
awsome!
please do trees and graph data structures in python
I have some stuff here (more coming): github.com/msambol/youtube
thanks!
welcome!
What program do you use to create these visuals?
Keynote on my Mac!
Damnn man i love ur videos 😊❤
Thats not 4 minutes. Its 21 seconds overshot
hopefully this one will get me a B- tomorrow.
Shoot for an A!
@@MichaelSambol thank you :) i was too busy to study watching world cup haha.
Tiktok for DSA hhhh. Thanks.
Do you have a ko-fi?
I don't..
This is hard