Which of the following best describes Skip list?
- A. A probabilistic data structure that uses multiple layers of linked lists to allow fast search within an ordered sequence. ✓
- B. A way of representing a graph where each vertex stores a list of its neighboring vertices.
- C. An abstract data structure where each element has a priority, and elements are served according to that priority rather than arrival order.
- D. A measure in a hash table calculated as the number of stored elements divided by the number of buckets.
Correct answer
A. A probabilistic data structure that uses multiple layers of linked lists to allow fast search within an ordered sequence.
Explanation
Skip list refers to a probabilistic data structure that uses multiple layers of linked lists to allow fast search within an ordered sequence.