1. Breadth first search.
2. A*.
3. Greedy best first search.
4. Bidirectional search (meet in middle).
1. Trie.
2. Priority Queue & Queue.
3. Stack.
4. Set.
5. Dictionary.
See Video on Youtube here
copyright © 2017, code released under the MIT License