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 structure where the nodes are arranged in a skewed manner, potentially degenerating into a linked list and adversely affecting operation time complexity.
Inorder Traversal
A technique where the nodes are visited in the order: left subtree, root, right subtree.
Level-Order Traversal
A method of visiting nodes in a tree data structure by exploring all nodes at the current depth level before moving on to nodes at the next depth level.
Huffman Coding
Used in data compression to represent variable-length codes.
Game Trees
Represent possible moves in two-player games for decision-making.
Complete Binary Tree
A tree where all levels are fully filled except possibly for the last level, which is filled from left to right.
Subtree
A portion of the tree that consists of a node and all its descendants.
Postorder Traversal
A strategy where the nodes are visited in the order: left subtree, right subtree, root.
Depth
The number of edges from the root to a specific node. The root is at depth zero.
Heap Data Structures
Used in priority queues for efficient access to max/min elements.