Started Trie implementation.

* Basic definition of Trie in comments at the top of the file
* Defined Trie class and method signatures.

Author: JavonDavis

data_structures/Trie/Trie.py

@@ -0,0 +1,21 @@
+'''
+A Trie/Prefix Tree is a kind of search tree used to provide quick lookup
+of words/patterns in a set of words. A basic Trie however has O(n^2) space complexity
+making it impractical in practice. It however provides O(max(search_string, length of longest word)) lookup
+time making it an optimal approach when space is not an issue.
+'''
+
+
+class TrieNode:
+    def __init__(self):
+        self.nodes = dict() # Mapping from char to TrieNode
+
+    def add_words(self, words: [str]):
+        for word in words:
+            self.add_word(word)
+
+    def add_word(self, word: str):
+        pass
+
+    def lookup_word(self, word: str) -> bool:
+        pass