Transfers ToCSUDescriptionThis course is a systematic study of data structures including lists, stacks, queues, priority queues, binary search trees, B- trees, Red-black trees, AVL trees, splay trees, hash tables, graphs and the union/find data structures. It covers analysis of algorithms including merge sort, quick sort, and heapsort. Graph theory including topological sort, depth-first search, shortest paths, and minimum spanning tree. If time permits, add any of the following topics: tries, Huffman codes, greedy algorithms, dynamic programming, and basic encryption algorithms. 