Added Trie (Prefix Tree)

Per josem#6 Added Trie using data from http://en.wikipedia.org/wiki/Trie and http://www.cs.cmu.edu/~fp/courses/15122-f10/lectures/18-tries.pdf
jade-42 · Sep 26, 2017 · 2e77539 · 2e77539
1 parent 6e52f45
commit 2e77539
Showing 1 changed file with 13 additions and 0 deletions.
diff --git a/index.html b/index.html
@@ -361,6 +361,18 @@ <h2 style="page-break-before: always;" id="data-structures">Common Data Structur
                   <td><code class="bigo-bad">O(n)</code></td>
                   <td><code class="bigo-bad">O(n)</code></td>
                 </tr>
+                <tr>
+                  <td><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie (Prefix Tree)</a></td>
+                  <td><code class="bigo-ok">O(M)</code></td>
+                  <td><code class="bigo-great">O(M)</code></td>
+                  <td><code class="bigo-great">O(M)</code></td>
+                  <td><code class="bigo-great">O(M)</code></td>
+
+                  <td><code class="bigo-ok">O(M)</code></td>
+                  <td><code class="bigo-ok">O(M)</code></td>
+                  <td><code class="bigo-ok">O(M)</code></td>
+                  <td><code class="bigo-ok">O(M)</code></td>
+                </tr>
                 <tr>
                   <td><a href="http://en.wikipedia.org/wiki/Binary_search_tree" target="_blank">Binary Search Tree</a></td>
                   <td><code class="bigo-ok">O(log(n))</code></td>
@@ -449,6 +461,7 @@ <h2 style="page-break-before: always;" id="data-structures">Common Data Structur
           </div>
 
           <p class="no-print"><span class="uk-badge">Note</span> * All have space complexity of O(n) except for Skip that has O(n log(n))</p>
+          <p class="no-print"><span class="uk-badge">Where</span> M is the length of a key.</p>
 
           <hr class="uk-grid-divider"><div class="page-break"></div>