Add topics and resources for tries and multiple key search trees

Author: neptunius

ReadMe.md

@@ -12,7 +12,7 @@
 |   2   |    Monday, April 30 | [Tree Traversals]                   |
 |   3   | Wednesday, May 2    | [Priority Queues & Heaps]           |
 |   4   |    Monday, May 7    | [Rotating Binary Search Trees]      |
-|   5   | Wednesday, May 9    | *Tries & Multiple Key Search Trees* |
+|   5   | Wednesday, May 9    | [Tries & Multiple Key Search Trees] |
 |   6   |    Monday, May 14   | *Graph Types & Representations*     |
 |   7   | Wednesday, May 16   | *Graph Traversals & Components*     |
 |   8   |    Monday, May 21   | *Spanning Trees & Shortest Paths*   |
@@ -30,3 +30,4 @@ Please follow [these instructions](Setup.md) exactly to set up your fork of this
 [Tree Traversals]: topics/BitManipulation.md#class-2-topics
 [Priority Queues & Heaps]: topics/Heaps.md
 [Rotating Binary Search Trees]: topics/RotatingTrees.md
+[Tries & Multiple Key Search Trees]: topics/MultipleKeyTrees.md

topics/MultipleKeyTrees.md

@@ -0,0 +1,40 @@
+## Tries & Multiple Key Search Trees
+
+### Topics
+- [*K*-ary tree (*n*-ary tree, *m*-way tree)][k-ary tree]
+- [Trie (prefix tree, radix tree)][trie]
+- [Self-balancing trees] with multiple keys: [2-3 tree], [B-tree]
+- [Space-partitioning] trees: [quadtree], [octree], [k-d tree]
+
+### Resources
+- Read Vaidehi Joshi's [BaseCS trie article] with beautiful drawings
+- Read Julia Geist's [trie article] and [trie slides] with animations and code samples
+- Play with USF's [interactive trie animations][USF trie]
+- Read Vaidehi Joshi's [BaseCS B-tree article] with beautiful drawings
+- Read Alex Dejeu's [2-3 tree article] with animations and code samples
+- Review Alex Dejeu's [B-tree slides] with examples and motivating context
+- Watch MIT's [2-3 tree and B-tree video lecture]
+- Play with USF's [interactive B-tree animations][USF B-tree]
+
+
+[k-ary tree]: https://en.wikipedia.org/wiki/K-ary_tree
+[trie]: https://en.wikipedia.org/wiki/Trie
+[self-balancing trees]: https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree
+[2-3 tree]: https://en.wikipedia.org/wiki/2%E2%80%933_tree
+[B-tree]: https://en.wikipedia.org/wiki/B-tree
+
+[space-partitioning]: https://en.wikipedia.org/wiki/Space_partitioning
+[quadtree]: https://en.wikipedia.org/wiki/Quadtree
+[octree]: https://en.wikipedia.org/wiki/Octree
+[k-d tree]: https://en.wikipedia.org/wiki/K-d_tree
+
+[trie slides]: https://docs.google.com/presentation/d/11LDrlureRaXyg6ZfjgJvdMZohLfk-0JYuB1RW2xVZDE/edit
+[trie article]: https://medium.freecodecamp.org/trie-prefix-tree-algorithm-ee7ab3fe3413
+[Julia trie article]: http://juliageist.com/blog/algorithms-and-data-structures/trie-prefix-tree/
+[BaseCS trie article]: https://medium.com/basecs/trying-to-understand-tries-3ec6bede0014
+[BaseCS B-tree article]: https://medium.com/basecs/busying-oneself-with-b-trees-78bbf10522e7
+[B-tree slides]: slides/B-Trees.pdf
+[2-3 tree article]: https://medium.com/@alexdejeu/9b50e3484a47
+[2-3 tree and B-tree video lecture]: https://www.youtube.com/watch?v=TOb1tuEZ2X4
+[USF trie]: https://www.cs.usfca.edu/~galles/visualization/Trie.html
+[USF B-tree]: https://www.cs.usfca.edu/~galles/visualization/BTree.html