LeetCode #208 Implement Trie (Prefix Tree)

Trie

Problem

Implement a trie with insert, search, and startsWith methods.

Example

1
2
3
4
5
6
7
8
Trie trie = new Trie();

trie.insert("apple");
trie.search("apple"); // returns true
trie.search("app"); // returns false
trie.startsWith("app"); // returns true
trie.insert("app");
trie.search("app"); // returns true
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
class TrieNode:
def __init__(self):
self.terminal = False
self.children = {}

class Trie:

def __init__(self):
"""
Initialize your data structure here.
"""
self.head = TrieNode()

def insert(self, word):
"""
Inserts a word into the trie.
:type word: str
:rtype: void
"""
head = self.head

for i in word:
if i not in head.children:
head.children[i] = TrieNode()
head = head.children[i]

head.terminal = True

def search(self, word):
"""
Returns if the word is in the trie.
:type word: str
:rtype: bool
"""
head = self.head

for i in word:
if i not in head.children:
return False
else:
head = head.children[i]

return head.terminal


def startsWith(self, prefix):
"""
Returns if there is any word in the trie that starts with the given prefix.
:type prefix: str
:rtype: bool
"""
head = self.head

for i in prefix:
if i not in head.children:
return False
else:
head = head.children[i]

return True


# Your Trie object will be instantiated and called as such:
# obj = Trie()
# obj.insert(word)
# param_2 = obj.search(word)
# param_3 = obj.startsWith(prefix)

###