Комментарии:
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
ОтветитьThis is hard
Ответитьawsome!
Ответитьwhat is the difference between the key and the data of the node?
and thank you great video
Whenever I wrote complete code why I can’t get result after run ?
Ответитьthanks!
ОтветитьThank you so so much <3 Love from GIU ( German International University) , Egypt
ОтветитьDamnn man i love ur videos 😊❤
ОтветитьHow this video has so few views? Your explanation was great, made me understand :)
Ответитьif the linked lsit is empty doesn't the head pointer points to the tail?
Ответить- Linked lists are a data structure for storing objects in linear order.
-
animation is extremely helpful for understaand the code, even thoughthis is list first time I learn linked list.
ОтветитьThats not 4 minutes. Its 21 seconds overshot
Ответитьis anyone else really annoyed that self.head is serving as an node object AND a pointer? that's just confusing lol
Ответитьplease do trees and graph data structures in python
Ответить3blue1brown of data structure, Thank you
Ответитьhopefully this one will get me a B- tomorrow.
ОтветитьWhat program do you use to create these visuals?
ОтветитьThats the first time i hear them called singly and doubly. I only ever hear single and double linked list..
ОтветитьYour videos have absolutely carried me through my comp science course. Absolute legend.
ОтветитьTiktok for DSA hhhh. Thanks.
ОтветитьNeed more video on data structure topic bro , waiting
Ответитьbro keep going we going to support u all the way!!
ОтветитьCan you do binary search in linked list?
Ответить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.
ОтветитьPlease, could you do videos on AVL trees ? Like the ones on r&b ? 😇
ОтветитьThe man, the myth, the legend. Great to see your videos again!
ОтветитьThank you for your amazing videos!
ОтветитьWelcome back my hero, I'm understanding everything thanks to your video.
ОтветитьStraight to the point 🎯
ОтветитьThe man came back!
ОтветитьDo you have a ko-fi?
ОтветитьThank you again for startig these series. Hope everything is good with you!
ОтветитьWill you make video on removing nodes from red-black tree?
Ответить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
ОтветитьWelcome back man, almost finishing my computer science degree and u decide to finally post again lol
Ответить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.
ОтветитьOMG you are back!
ОтветитьThank you so much! A video on dynamic programming and greedy algorithms would be amazing
ОтветитьThe day i wrote my algorithms and data structure exam, you started posting videos again, after 5 years
ОтветитьPlease make vedio on topological sorting
ОтветитьWelcome Back 🔥🔥🔥❤️😊
Ответить