Class Node

pygorithm/data_structures/trie.py:6–11

'''

class Node:
    def __init__(self, v, p=None, w=False):
        self.word = w #If the node represents the end of a word or not
        self.parent = p
        self.value = v
        self.children = {}


class Trie: