Through this class, I gained a much better understanding of classifying algorithmic efficiencies, as well as learning about some important algorithms like the merge sort algorithm, Djikstra's algorithm, Kruskal's algorithm.
I also learned about some very useful data structures like binary trees, how to build balanced binary trees (AVL trees, red-black trees, and 2-4 trees), hashing, hash tables, maps, binary heaps, stacks, queues, and priority queues.
These data structures, accompanied with a strong understanding of the efficiencies of the algorithms upon which they run, will no doubt be useful in the future as I work with processing and storing data using these data structures. To be able to understand what data structures will be most appropriate in various situations will no doubt be invaluable to my future career.