Graph, A set of nodes connected by arcs, Tree, A connected, undirected graph with no cycles, Binary Tree, Tree where each node has maximum of two branches, Hash Table, ADT with O(1) average search, Stack, FILO, Dictionary, ADT made up of (key, value) pairs, Leaf, A node with no sub-nodes, Root, The start node of a tree, Adjacency Matrix, Inefficient representation of a sparse graph, Adjacency List, Inefficient representation of a highly connected graph, Collision, Results of two items hashing to the same value.
0%
A-Level.U7.Data Structures T4-7
Share
Share
Share
by
Jnicholson4
KS5
Computing
Data Structures
Edit Content
Print
Embed
More
Assignments
Leaderboard
Show more
Show less
This leaderboard is currently private. Click
Share
to make it public.
This leaderboard has been disabled by the resource owner.
This leaderboard is disabled as your options are different to the resource owner.
Revert Options
Match up
is an open-ended template. It does not generate scores for a leaderboard.
Log in required
Visual style
Fonts
Subscription required
Options
Switch template
Show all
More formats will appear as you play the activity.
Open results
Copy link
QR code
Delete
Continue editing:
?
