Code safely callable again before prior call finishes.

Heap with at most two children per node.

B-tree variant commonly used in databases.

Heuristic search for shortest paths.

Data private to each thread.

Key-value data structure using hashing.

Tree structure optimized for string prefixes.

Lowest-cost tree connecting graph vertices.

Concurrency model based on independent actors.

Collection mapping keys to values using hashes.