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.

Search algorithm repeatedly dividing a sorted range.

Method for organizing and storing data.

Self-balancing binary search tree.

Event where multiple keys produce the same hash location.