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.
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.
Leaf Node
A node that has no children, meaning it is at the end of a branch.
Breadth-First Traversal
A tree traversal technique that processes all sibling nodes before proceeding to their children, ensuring that nodes are visited in a level-wise manner.
Traversal Algorithms
Crucial in searching, sorting, and evaluating hierarchical data.
Full Binary Tree
A tree structure where every node, except for the leaves, has exactly two children.
Root
The top node in a hierarchical structure.
Child
A node that is a direct descendant of another node. A node can have a left child and a right child.
Siblings
Nodes that share the same parent.
Subtree
A portion of the tree that consists of a node and all its descendants.
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.