This test is run by .
Note that your final mark will not be saved in the system.
Note that your final mark will not be saved in the system.
10. Data Structures MatchUp
Target Level
C
Running Total
0
0%
Attempt
1 of 3
Click on a top box, then click on its match below. Or, drag a top box and drop it onto the correct match. Match all pairs before clicking ‘Check’.
Pre-order
Tree
Undirected
Queue
Element
Tuple
Directed
Linked list
Stack
Post-order
Graph
Array
In-order
Record
The means of traversing a tree in which the root node is read first.
A type of graph in which edges cannot be traversed in both directions.
A data structure whose dimensions must be determined upon its creation, in which every placeholder has a unique zero-based index.
A generic term that refers to a data structure comprising multiple parts.
The means of traversing a tree in which the root node is read last.
A data structure of which 'tree' is a subtype.
A data structure to store the contents of a keyboard buffer.
A type of data structure which is commonly selected in preference to an array, when a combination of different data types is to be stored.
A data structure in which a node comprises a data item and multiple pointers to additional data items.
The means of traversing a tree in which the root node is read between the left subtree being read and the right subtree being read.
A type of graph in which edges can be traversed in either direction.
A data structure that is well suited to handling the 'undo' function of any application, in which the action you wish to undo is the most recent action.
The term given to each location within an array.
A data structure in which a node comprises a data item and a pointer to the next data item.