Skip lists allow search, insert, and delete operations in O(log n) average time. However, they show a lack of efficiency when dealing with data exhibiting locality of reference, meaning the keys are searched or updated ...