Data Structures
Skip List: A Probabilistic Data Structure for Search, Insert and Delete
Skip List is a probabilstic data structure that gives us O(log n) average complexity (and O(n) for worst case for all) for search, insert and delete operations. Why do we need this? If we think about the sorted linked list, when we search some target value we need