A Skip List is a Probabilistic Data Structure Allowing for Efficient Searching, Insertion, and Deletion of Elements Within a Sorted Sequence, Mostly used with Balanced Search Trees (AVL, Red-Black) Due to its Comparable Average-Case Performance (O log n)