NelsonBN / algorithms-data-structures-skip-list

Algorithms and Data Structures - Skip List

Algorithms and Data Structures - Skip List

Characteristics

• 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

Demos

• No Duplicates
• Allowing Duplicates

References

• Other Algorithms & Data Structures