Lists — Interactive Visualization

index value

Click a button to interact. Array: fixed-size, contiguous memory. O(1) access, O(n) insert/delete.

Push elements to see the vector grow. Capacity doubles when full.

value

Linked list: O(1) insert/delete at known node, O(n) access by index. Poor cache locality.

value

Stack (LIFO): push and pop at the top. O(1) for both operations.

value

Queue (FIFO): enqueue at tail, dequeue from head. O(1) for both operations.

element

Bloom filter: probabilistic membership test. No false negatives, tunable false positives.