Shows a trie (prefix tree) where each node represents the prefix formed by edge labels from the root. An animated cursor performs searches one character at a time by following child_map[char] edges, highlighting the active path and checking the terminal marker to decide whether the traversed prefix is a complete stored key.
Uses a prebuilt example trie (to/tea/ted/ten/in/inn). Layout is computed once via leaf ordering and averaging to place internal nodes. Animation cycles every 4s across several search queries; the cursor interpolates between nodes with cubic easing, and traversed edges/nodes are highlighted in GREEN with terminal nodes marked by a small square.