datastructures

Train compartments in a row

Treasure hunt clues pointing to next

A family tree with parent and children

A library card catalog

A pile of pancakes, last in first out

A line at an amusement park

Networks of connected nodes

Priority queues with fast access to min/max

Each node has at most two children

Trees for storing strings efficiently

Collections with no duplicates

Key-value pairs for lookup

Double-ended queues

Highest priority items served first

Probably yes or definitely no