http://stackoverflow.com/questions/487258/what-is-a-plain-english-explanation-of-big-o-notation
https://justin.abrah.ms/computer-science/big-o-notation-explained.html
https://en.wikipedia.org/wiki/Big_O_notation
https://en.wikipedia.org/wiki/Linked_list
https://en.wikipedia.org/wiki/Hash_table
https://en.wikipedia.org/wiki/Graph_(abstract_data_type)
https://en.wikipedia.org/wiki/Tree_(data_structure)
https://en.wikipedia.org/wiki/Stack_(abstract_data_type)
https://en.wikipedia.org/wiki/Queue_(abstract_data_type)
https://en.wikipedia.org/wiki/Heap_(data_structure)
https://en.wikipedia.org/wiki/Binary_search_algorithm
https://en.wikipedia.org/wiki/Depth-first_search
https://en.wikipedia.org/wiki/Breadth-first_search
https://en.wikipedia.org/wiki/Graph_traversal (Similar to depth/breadth first search, but with some caveats due to it being a graph, not a tree)
https://en.wikipedia.org/wiki/Merge_sort
https://en.wikipedia.org/wiki/Quicksort (I always have trouble with this one... don't be surprised if you don't get it right away)
https://en.wikipedia.org/wiki/MapReduce (Google loves to ask questions where the answer is Map Reduce as that was the basis for the original search engine, iirc)