Skip List Introduction

Course Name: Algorithmic Problem Solving

Course Code: 23ECSE309

Name: Adarsh Sidnal

University: KLE Technological University, Hubballi-31

Introduction

A skip list is a data structure that provides a probabilistic alternative to balanced search trees like AVL trees or red-black trees. It allows for efficient search, insertion, and deletion operations with an average time complexity of O(log n).

Here is the implementation of Skip List Click Here

Time and Space Complexity

Operation Time Complexity Space Complexity
Insert O(log n) O(n)
Delete O(log n) O(n)
Search O(log n) O(n)

© 2024 Adarsh Sidnal - KLE Technological University, Hubballi-31