Deep Link Route Resolver (2D)

A mobile app's deep-link router does not scan every registered path for every incoming URL - it walks a radix trie one path segment at a time, choosing between a literal child and a parameter child (:id) at every branch, and backtracking up the tree when a branch dead-ends. This simulator builds a real trie from a small e-commerce app's route table and renders it as a pannable, zoomable 2D tree; picking an incoming deep link and pressing "Resolve route" sends a traveling marker down the exact path the matching algorithm takes, live counters track how many nodes the resolver actually visits and the resulting match-time estimate, and a static-first/param-first toggle demonstrates the real ambiguity bug that appears when a literal route and a parameter route can both accept the same segment.