Tree where each node has at most two children.

Graph traversal exploring deeply before backtracking.

Last-in-first-out data structure.

Ordered binary tree supporting efficient search.

Ordering vertices according to directed dependencies.

Double-ended queue.

Self-balancing binary search tree.

Path minimizing total distance or cost.

Resource accessed by multiple tasks.

Queue ordered by item priority.