[]Data structures

See how stacks, queues, hash tables, and tries store and find data. — 10 entries

A last-in, first-out structure: the newest item leaves first.

A first-in, first-out structure: the oldest item leaves first.

Each node stores a value and a reference to the next node.

Map keys through a hash to buckets for lookup and storage.

A binary tree with smaller values left and larger values right.

Retrieve the highest-priority item efficiently.

A tree that shares common prefixes among words and follows one character per edge.

Uses a compact bit array to say “definitely absent” or “possibly present.”

Quickly checks whether items belong to the same component and merges components.

Places keys and servers on one hash ring so membership changes move only some keys.