DataStructures/trie_node.py at master · ChillBroYo/DataStructures · GitHub

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
# Trie Node: implemented to be as versitile as possible, with unique children

class TrieNode:
    def __init__(self,value=None,parent=None):
        self.children = {}
        self.parent = parent
        self.value = value
        self.times_added = 0

    def recursion_helper(self, value, pass_value=None, pass_node=None):
        if self.value == value:
            return True
        else:
            for node in pass_node.children:
                return self.recursion_helper(value, None, node)

        return False


    def add_child(self, value):
        if self.children.get(value) == None:
            self.children[value] = TrieNode(value, self)
        else:
            self.children[value].times_added += 1

    def remove_child(self, value, remove_sub_children=False):
        if self.children.get(value) == None:
            return False
        else:
            return self.remove(value)


    def remove(self, remove_sub_children=False):
        # Full family with keeping children
        if self.parent and len(self.children) > 0 and remove_sub_children == False:
            temp_val = self.children
            parent = self.parent
            del self.parent.children[self.value]
            parent.children.update(temp_val)
        # Full family with children removal
        elif self.parent and len(self.children) > 0 and remove_sub_children == True:
            del self.parent.children[self.value]
        # Parent with no children (removing sub children is irrelevant here)
        elif self.parent and len(self.children) == 0:
            del self.parent.children[self.value]
        # Removing root that has children with no children removal
        elif self.parent and len(self.children) > 0 and remove_sub_children == False:
            new_root = TrieNode(self.children[0].value)
            del self.children[0]
            new_root.children = self.children
            self.children = None
            del self
        # Only case left should be remove all
        else:
            del self

        return True