Trie
ordered tree data structure that organizes nodes by common key prefixes
In computer science, a trie is a type of tree (data structure). A trie is often used to store a set. Common prefixes among items within the trie are stored only once.
In computer science, a trie is a type of tree (data structure). A trie is often used to store a set. Common prefixes among items within the trie are stored only once.