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 strategy where the nodes are visited in the order: left subtree, right subtree, root.
Inorder Traversal
A technique where the nodes are visited in the order: left subtree, root, right subtree.
Parent
A node that has one or more children. Every node, except the root, has one parent.
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.
Leaf Node
A node that has no children, meaning it is at the end of a branch.
Root
The top node in a hierarchical structure.
Balanced Binary Tree
A tree structure that maintains a height difference of at most one between its left and right subtrees, promoting efficient performance for operations.
Deletion
Can be more complex as it requires careful consideration of the node's children, with different cases arising depending on whether the node to be deleted has zero, one, or two children.
Binary Tree
A tree data structure in which each node has at most two children, which are referred to as the left child and the right child.
Game Trees
Represent possible moves in two-player games for decision-making.