| 1 | """ |
| 2 | A Trie/Prefix Tree is a kind of search tree used to provide quick lookup |
| 3 | of words/patterns in a set of words. A basic Trie however has O(n^2) space complexity |
| 4 | making it impractical in practice. It however provides O(max(search_string, length of |