A Trie (prefix tree) is a tree-like data structure used to store a dynamic set of strings, allowing for efficient retrieval of keys based on their prefixes.
import { Trie } from "collection-kit";
import { Trie } from "collection-kit";
const trie = new Trie();
trie.insert("apple");
trie.insert("app");
trie.insert("application");
console.log(trie.search("app")); // true
console.log(trie.startsWith("appl")); // true
console.log(trie.search("banana")); // false