Radix Trie Compression: From Trie to PATRICIA

This simulator builds a real character trie from an editable word list and lays it out as a 2D tree diagram, then compresses it into a radix trie (PATRICIA trie) with the exact node-merging algorithm real prefix indexes use — both structures are drawn side by side with a real tidy-tree layout so you can watch the node count fall. Type a prefix into the query box to walk both structures at once, edge by edge, and see the matched path highlighted plus every word it leads to — the simulator cross-checks that the trie and the compressed radix trie always return the same result set, exactly as a real autocomplete engine must, whichever internal representation it happens to use.