- Time complexity - Search / Insertion / Deletion:
- Best: Ω(1)
- Average: Θ(log n)
- Worst: O(n) - very rare to happen
- Space complexity: O(n log n)
- Probabilistic Data Structure
-
Notifications
You must be signed in to change notification settings - Fork 0
Algorithms and Data Structures - Skip List
License
NelsonBN/algorithms-data-structures-skip-list
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Algorithms and Data Structures - Skip List