- Graph: A data structure which is made up of vertices/nodes that are connected by edges/pointers.
- Node: An item in a tree
- Edge: Connects two nodes together and is also known as a branch or pointer
- Root: A single node which does not have any incoming nodes
- Child: A node with incoming edges
- Parent: A node with outgoing edges
- Subtree: A subsection of a tree consisting of a parent and all the children of a parent
- Leaf: A node with no children
- Traversing: The process of visiting each node in a tree data structure, exactly once
- Modulus: The operation that gives the remainder when one number is divided by another. It is denoted by the symbol %
- Static Data Structure: Has a fixed size, meaning that they cannot be modified or resized during runtime
- Queue: An abstract data structure that holds an ordered, linear sequence of items. It is a First in First out structure.
- FIFO: First In First Out
- Dynamic Data Structure: Able to adapt and accommodate changes to the data inside it so it doesn’t waste as much space in memory.
- Pointer: An object that stores a memory address
- In-order successor: The in-order successor of the node or simply the minimum node in the right subtree if the right subtree of the node is not empty.
- Directed Graph: A directed graph is a set of objects that are connected together, where the edges are directed from one vertex to another.
- Undirected Graph: An undirected graph is a set of objects that are connected together, where the edges do not have a direction.
- Weighted Graph: A weighted graph is a set of objects that are connected together, where a weight is assigned to each edge.
- Adjacency Matrix: Also known as the connection matrix is a matrix containing rows and columns which is used to present a simple labelled graph.
- Adjacency List: This is a collection of unordered lists used to represent a finite graph.
- Vertices/Nodes: A vertex (or node) of a graph is one of the objects that are connected.
- Edges/Arcs: An edge (or arc) is one of the connections between the nodes (or vertices) of the network.
- Dictionary: A collection of names, definitions, and attributes about data elements that are being used or captured in a database, information system, or part of a research project.
- Enqueue: Adding a data item to the back of a queue data structure.