absurdprofit / trie-data-structure Goto Github PK

Trie data structure implemented in python. A class TrieNode is created which has methods add, to add words to the trie and find to find words in a trie. Find returns a boolean to indicate if the word was found in its entirety or not, the index of the last character found in the word, the unique value given to the trie node and the last trie node object found.