1procedure insert(root, word)
2 node ← root
3 for each character c in word
4 if c not in node.children
5 node.children[c] ← new TrieNode
6 node ← node.children[c]
7 node.isEnd ← true
8procedure search(root, word)
9 node ← root
10 for each character c in word
11 if c not in node.children
12 return false
13 return node.isEnd