Skip List is a probabilistic data structure that allows the insertion, deletion, and searching of a sorted linked list in O(log n) time complexity and thus it gives the features of a sorted array while maintaining a linked list structure.
Timestamp
Motivation for Randomized Data Structures: 0:00:00
What and Why Skip List: 0:03:22
Build of Skip List: 0:07:20
Searching in Skip List: 0:22:05
Insertion in Skip List: 0:27:45
Deletion in Skip List: 0:30:22
Stay tuned for more content on
Data structure & Algorithm
Data Science
Podcasts
and many more
Thanks for watching!
Subscribe to my channel, leave all your career-related queries in the comment section & let's make this initiative a success together.
----------------------------------
Connect with me on Social Media-
LinkedIn : https://www.linkedin.com/in/bhatia-priya/
GitHub: https://github.com/priya6971
For paid promotions / collaborations/ business enquiries drop an email-
[email protected]
