Data Structureshard

What is a skip list and how does it compare to balanced trees?

Answer

A skip list is a layered linked-list structure where some nodes are promoted to higher levels randomly. It gives expected O(log n) search/insert/delete (like balanced trees), is simpler to implement, but its performance is probabilistic.

Related questions

Data Structures

What is a Bloom filter and what trade-off does it make?

#bloom-filter#probabilistic#hashing

Data Structures

What is a segment tree and what complexity does it give for range queries and updates?

#segment-tree#range-query#updates

Data Structures

Building a heap from an array: why can it be O(n), not O(n log n)?

#heap#heapify#complexity

Data Structures

Why can a hash table resize cause latency spikes, and how can you mitigate it?

#hash-table#rehash#latency

Data Structures

Singly vs doubly linked list: when would you choose each?

#linked-list#singly#doubly

Data Structures

What is a sparse table and what problems is it good for?

#sparse-table#rmq#preprocessing