Daniel Abramov daniel-abramov
daniel-abramov
/ trie.py
Created
June 12, 2016 16:24
Simple implementation of trie data structure, O(n) for finding words
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Trie: | |
| def __init__(self): | |
| self.trie = dict() | |
| def insert(self, key, value): | |
| p = self.trie | |
| for c in key: | |
| if c not in p: p[c] = dict() | |
| p = p[c] | |
| p[None] = value |
NewerOlder