Node Path Bloom

Node Path Bloom teaches binary search trees by making you live inside one. A number arrives at the root. The root holds a value. If the arriving number is smaller, it belongs in the left subtree. If larger, the right. The player taps left or right. The number animates down the glowing edge to the next node, where the same decision waits. And the next. And the next. When the number reaches an empty slot, it crystallises there as a new node — a burst of gold sparks, the tree grows one branch, another number arrives. This is the binary search tree insertion algorithm. Every computer science student has read it. Node Path Bloom is what it feels like to execute it at speed under pressure. Easy mode gives uniform time at every node. The window starts at two and a half seconds and shrinks with every three correct insertions. At level five the window is under two seconds. At level ten it is under one and a half. The tree grows deeper as the game progresses — a first-level tree has one comparison per insertion, a three-level tree has up to four. The same two-second window that felt generous at the root feels brutal four levels down. Hard mode adds weights. Each node displays a small coloured badge — blue for weight one, teal for two, amber for three, orange for four, crimson for five. A timer ring around the active node depletes at a rate determined by that weight. Weight one gives two and a half seconds. Weight five gives half a second. The player must learn to read the upcoming path before the orb arrives, anticipating which nodes will demand instant decisions and which will allow a breath. Watching a weight-five root node drain the timer before the player has processed the comparison is the game's most instructive moment: every single insertion must pass through the root, which means a heavy root costs time on every insertion in the game. This is the concept of weighted path length, which underlies Huffman coding and optimal binary search tree design. Node Path Bloom never states this. It makes the player feel it. When fifteen nodes are correctly placed, the full tree blazes gold simultaneously and resets with a bonus. The new tree begins faster. The weights in hard mode are randomly assigned at each node's creation, so no two trees feel the same. Easy mode teaches BST insertion as reflex. Hard mode teaches why the structure of a tree — which values sit near the root, how deep each path runs — determines the cost of every operation performed on it.