def insert(self, word):
word += '\0'
prev = cur = self.root
i = 0
while cur is not None:
prev = cur
if word[i] < cur.label:
cur = cur.left
elif word[i] > cur.label:
cur = cur.right
else:
if i == len(word) - 1:
return
cur = cur.mid
i += 1
# create first node of subtree
cur = TNode(word[i])
# if root is empty, put subtree as root
if prev is None:
self.root = cur
else:
# find in which direction we should put the newly created subtree
if word[i] < prev.label:
prev.left = cur
elif word[i] > prev.label:
prev.right = cur
else:
prev.mid = cur
i += 1
# create subtree of word suffix that was not found in the tree
while i < len(word):
cur.mid = TNode(word[i])
cur = cur.mid
i += 1
# increase size of the tree
self.size += 1
def insert(self, word):
word += '\0'
prev = cur = self.root
c = None
i = 0
break_inner = False
while i < len(word) and cur is not None:
prev = cur
j = 0
while j < len(cur.label) - 1:
c = cur.label[j]
if word[i + j] != c:
common_prefix = cur.label[:j + 1]
label_suffix = cur.label[j + 1:]
new = TNode(label_suffix)
new.left = cur.left
new.mid = cur.mid
new.right = cur.right
cur.label = common_prefix
cur.left = None
cur.mid = new
cur.right = None
break_inner = True
break
j += 1
i += j
if break_inner:
break
c = cur.label[j]
if word[i] < c:
cur = cur.left
elif word[i] > c:
cur = cur.right
else:
if i == len(word) - 1:
return True
cur = cur.mid
i += 1
# create first node of subtree
cur = TNode(word[i:])
# if root is empty, put subtree as root
if prev is None:
self.root = cur
else:
# find in which direction we should put the newly created subtree
if word[i] < c:
prev.left = cur
elif word[i] > c:
prev.right = cur
else:
prev.mid = cur
# increase size of the tree
self.size += 1
