Basic Data Structures: Data CollectionsLinear structures
Array: Fixed-size
Linked-list: Variable-size
Stack: Add to top and remove from top
Queue: Add to back and remove from front
Priority queue: Add anywhere, remove the highest priority
Hash tables: Unordered lists which use a ‘hash function’ to insert and search
Tree: A branching structure with no loops
Graph: A more general branching structure, with less stringent connection conditions than for a tree
Kinds of Operations
Builders
Change the contents of the data structure
Viewers
Retrieve the contents of the data structure
Queries
Return information about the data structure
Iterators
Return each element of the data structure, in some order