Heap where the largest element has highest priority.

Data structure mapping keys to values using hashing.

Construct that produces values incrementally.

Method systematically trying possible solutions.

Tree where each node has at most two children.

Key-value structure commonly implemented using hashing.

Object or mechanism for iterating through a collection.

Practical method that seeks a good solution efficiently.

Binary tree maintaining an ordered search property.

Set implementation using hashing.