In this video, I have explained what is skip list and how does it helps in optimizing search in a sorted linked list.
A skip list is a data structure that is used for storing a sorted list of items with a help of hierarchy of linked lists. The skip list data structure skips over many of the items of the full list in one step, that’s why it is known as skip list.
00:00 Introduction
00:04 Searching in Sorted Linked List
02:08 Skip List
07:22 Skip List Search Algorithm
11:19 Advantages / Disadvantages
-------------------------------------------------------------
I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC.
If you like my content, please like, share my videos and subscribe to the channel.
-------------------------------------------------------------
For Linked List tutorials, please refer to the below playlist:
• Linked List
For Binary tree tutorials, please refer to the below playlist:
• Tree Data Structures
For Binary search tree tutorials, please refer to the below playlist:
• Binary Search Tree
For in-depth Graph theory and implementation details, please refer to the below playlist:
• Graph Algorithms
#DataStructure,#LinkedList,#FitCoder,#Algorithm,#competitiveprogramming,#faang,#codinginterview