Tag: trie
-
Prefix Tree vs Hash Map: 47% Slower Insert Reality
Prefix Tree insert operations benchmark 47% slower than Hash Map despite O(m) complexity. Deep dive into memory layout and cache behavior reveals why.
-
Trie for Fast String Search: Autocomplete in Python
Build a trie in Python that beats naive search by 40x on prefix queries. Covers autocomplete, Word Search II, and deletion edge cases.