4.2 Data Structures

A data structure that consists of an ordered, finite set of elements of a single data type.

Data is stored contiguously in memory for efficient access mutable - content can be changed static - size can’t be changed after the array is declared

A collection of related attributes/fields under a single identifier.

mutable - the content can be changed

A data structure that consists of an ordered, finite set of elements of any data type.

dynamic - size can be changed after declaration mutable - content can be changed

An immutable, static data structure used to store an ordered, finite set of elements of any data type.

An abstract data structure that consists of nodes that each contain data and a pointer that is the address of the next node in the list.

null pointer for end of list start pointer to first node in list next free pointer to next available node in list

An abstract data structure comprising of nodes and edges. Edges can have weights (costs) and directions and connect nodes together.

An abstract static data structure where the last item in is the first item out.

A pointer to the top item in the stack.

An abstract data structure where the first item in is the first item out.

a front and rear pointer

A hierarchical abstract data structure with a root node and child nodes and branches that connect parent nodes to child nodes.

A tree where each node can have up to 2 child nodes.

An abstract data structure where a hash function is applied onto the data to produce a hash. This hash is the address in the hash table where the data is stored.