@tkg808/trie-search (npm): A flexible implementation of a trie (prefix tree) to let you efficiently find partial and complete matches of stored values. A trie is a tree-like data structure, also referred to as a prefix tree, that enables optimized searching for specific keys from a
Keywords: trie|prefix|tree|search|autocomplete|typeahead