Augmented Skip List is a probabilistic data structure that extends the standard skip list by incorporating additional auxiliary information or pointers at nodes to support enhanced operations such as efficient range queries, order statistics, or dynamic indexing while preserving the logarithmic expected-time complexity for search, insertion, and deletion.