The 'TrieNode' data structure is used to index text in a prefix-tree manner, for more efficient storage usage and fuzzy-search algorithms with better a better runtime than when using a simple map.
Internal reference for the children of the current node.
Internal reference for the data items of the current node.
The 'TrieNode' data structure is used to index text in a prefix-tree manner, for more efficient storage usage and fuzzy-search algorithms with better a better runtime than when using a simple map.