Our site uses cookies. Some of the cookies we use are essential for parts of the site to operate and have already been set. You may delete and block all cookies from this site, but parts of the site will not work. To find out more about cookies on this website, see our Cookie Policy
Accept
© eRevision.uk and ZigZag Education 2025
This test is run by .
Note that your final mark will not be saved in the system.

3 - 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’.

Undirected
Queue
In-order
Vector
Post-order
Element
Stack
Directed
Graph
Pre-order
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
The means of traversing a tree in which the root node is read last
A data structure of which 'tree' is a specific type
A data structure to store the contents of a keyboard buffer
This is related to a matrix but, unlike a matrix, it's always one-dimensional
The means of traversing a tree in which the root node is read between the left sub-tree being read and the right sub-tree 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

This is your 1st attempt! You get 3 marks for each one you get right. Good luck!

Pass Mark
75%