Choose one to explore step by step

Structures for storing and retrieving data

Linear

A last-in, first-out structure returns the most recently added value.

A first-in, first-out structure returns the earliest added value.

A deque supports insertion and removal at both ends.

Nodes store values and references that link them in sequence.

A binary search tree stores smaller values on the left and larger values on the right.

This example uses a min-heap, where parents are no greater than their children.

Map a key through a hash function to select its storage bucket.