Simplest explanation and I also see it being pointing out the relevant cases and I feel I can implement this. Also feel what deletion should look like. I saw other videos that either make the topic "badly explained" and seem hard while this seem extreme easy to implement - or also found videos lacking in delving deep-enough for implementation. Good work! PS.: I actually invented two new data structures while watching your video. Both are theoretically - and likely practically - faster than this and also keeps a sorted set data structure. They have more cache locality and one of them has clearly O(1) operations for insert/search/delete (basic operation count like 25-32 when implemented well).
This is the best video about the skip list ever. Thanks.
Don't skip this skip list explanation..... wonderful teaching.... crystal cleared
Thanks from Russia, i study a book by Stroustrup and in 18 chapter have task with Skip List. Your video very helpful
Simplest explanation and I also see it being pointing out the relevant cases and I feel I can implement this. Also feel what deletion should look like.
I saw other videos that either make the topic "badly explained" and seem hard while this seem extreme easy to implement - or also found videos lacking in delving deep-enough for implementation. Good work!
PS.: I actually invented two new data structures while watching your video. Both are theoretically - and likely practically - faster than this and also keeps a sorted set data structure. They have more cache locality and one of them has clearly O(1) operations for insert/search/delete (basic operation count like 25-32 when implemented well).
Best Explanation of skiplist
Aaj mera paper hai 2 baje air skip list 100 % aane vali hai... Dhanyawad Sir for uploading video 🥺 !!!
This is not the best, this is the Greatest
Nihao for the algorithms lecture, Mr. Wang.
Wtf? "Nihao" doesn't mean what you think it does.
Racist pig
Thank you very much Mr. Wang, you have made it clear to me, really a very well prepared video
Excellent and outstanding.... Thank you so much. Please add Time complexities for all operations
Great and very clear lecture! Thanks a lot
please explain deletion when you have time, especially on how to memorize the pointers along the search path
Best video on this topic! Thank you sir
very clear explanation, professor
Great video. Covered different use cases.
Very clear! Well done Shusen
Absolutely incredible nice one about skip lists
Nice Video and with a speed of 2 actually normal speed :D
nice explanation, really easy to understand
Beautifully explained sir
an awesome video to explain skip list!
DI gang incoming
A man of culture
Absolutely gorgeous! Thank you so much!
Great explanation 👏
That was a good explanation 😍
Definitely
if we perform lots of insertion, is it's ok to rebuild the skip list
Beautiful! Thanks for your effort!
😊 😊 🙏
thank you so much for sharing this video!
Super explanation.. Thank you
but how to calculate the address of a node?>
Hey, awesome video! What software did you use to do this animations?
Great video if you watch with 2x speed
Nice video , very informative
Amazing video!
Thank you for this video.
Really helpful video
Great animation
Great video
Great job
Good video. Thanks!
Excellent !
What if the coin always comes up heads ？ XD
😂😂😂
very nice ..Thank you
flip a coin. It happens to be the tail
well explained
Thank you so much!
ahh yes Data Structures... quite possibly one of the most difficult papers you could take at university
Thank you!
Super good
大佬加入小红书就不更新了😭
Thx bro!!!
legend
amazing
exellent
Gold
OP
gg
Flip a coin...