Book: A Common-Sense Guide to Data Structures and Algorithms, Second Edition
In the statement def collectAllWords(self, node=None, word=“”, words=
code:
# A trie is a tree build from hash table. each node is a hash table pointing to the
# address of another hash table. This is commonly used for word auto complete.
class trie:
def __init__(self):
self.root = trieNode()
# search for a word in the trie, return last node found
def search(self, word):
current_node = self.root
# check every character in string to determin if in trie
for chr in word:
if current_node.children.get(chr):
current_node = current_node.children[chr]
# if not in return
else:
return
# return final node
show original
explanation of why:
