Set implemented using hashing.

Matrix representing graph connections.

Loop that does not terminate normally.

Hierarchical data structure of connected nodes.

List-based representation of graph connections.

Statement that exits a loop or control structure.

Indexed collection of elements.

Tree where each node has at most two children.

Node in a graph.

Statement that skips to the next loop iteration.