Structs, classes, linked lists, stacks, queues, dynamic arrays, and hash tables.
Model related state and behavior.
Build, traverse, and destroy a linked list.
Implement last-in, first-out operations.
Implement first-in, first-out processing.
Grow contiguous storage as values are appended.
Count words with separate chaining and unordered_map.