Amazing explanation, have not seen such a simple explanation for a complex data structure like this. Thank you. I came across this to understand the HNSW Algorithm for indexing in vector databases!
No, both are not same. You can consider it this way. There are two types of skip lists : 1) Perfect Skip List, also also known as Deterministic 2) Randomised Skip List, also known as Indeterministic Major difference between the two : 1) In perfect skip list, every second element is taken to the next upper level during insertion , while in Randomised case, a toin is closed at each level to decide if the element is to be taken to the next upper level 2) Heigh of perfect skip list is O( logn), while in Randomised Skip list, height is probabilistically determined. All the above things are clearly explained in the two videos of Skip List. But, I hope your doubt is cleared.
Thank You for calling it "Awesome".. Means a lot☺️ The audio issue I hope is manageable, but I have ensured that this issue is not present in almost all the videos Keep learning🖤🖤🖤
