Loop cards are a great game that can be played individually or as a class. They are perfect for review key vocabulary or questions at the end of a topic or when revising for an exam.
Instructions
Cut out the cards from the paper horizontally (but don't cut them in half!) and then shuffle them.
Now start joining each question on the right hand side of the card to the matching answer on the next card.
Carry on until all the cards loop together and you have competed the game!
Hint: Make sure that you set your paper to portrait to print 4 cards per sheet of A4 paper.
A tree traversal algorithm that visits the root node first, then recursively visits the left subtree and finally the right subtree.
Binary Tree
A tree data structure in which each node has at most two children.
In-Order Traversal
A tree traversal algorithm that visits the left subtree first, then the root node, and finally the right subtree.
Depth-First Search
A graph traversal algorithm that explores as far as possible along each branch before backtracking.
Binary Search Tree
A structure in which the key in each node is greater than all keys in its left subtree and smaller than all keys in its right subtree.
Breadth-First Search
A graph traversal algorithm that explores all the vertices of a graph in breadth-first order, i.e., visiting all the vertices at the same 'level' before moving on to the next 'level'.
Post-Order Traversal
A tree traversal algorithm that visits the left subtree first, then the right subtree, and finally the root node.