This resource provides low-stakes, immediately self-scored practice that supports MO1 by requiring students to assemble and label the structural components of a binary tree, and strongly supports MO2 by having them predict and verify in-order, pre-order, and post-order output while seeing the practical use case for each (infix, prefix, and postfix notation). The gamified rounds and instant feedback add motivation and repetition before students move on to the implementation work required by MO3 and MO5, where the same traversal logic must be coded in JavaScript.
Added October 19, 2026