Multiple ChoiceHard 30s
Skip List
A skip list provides O(log n) operations using:
Options
- 1A hash table that uses chained collision buckets
- 2A single sorted array that uses binary search
- 3Multiple levels of linked lists with random promotion
- 4A binary tree kept balanced by node rotations
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.