These notes are primarily from:

Data Structures and Algorithms in Java, Goodrich and Tamassia, Wiley, ISBN 0-471-38367-8

1. Data Structures and Asymptotic Analysis
2. Vectors and lists
3. Containers and General Trees
4. Binary Trees and Transversals
5. More Traversals, Iterators and Inheritance
6. Priority Queue
7. Heaps
8. In-place Heap Sort
9. Dictionaries and Hashing
10. Ordered dictionaries
11. Binary Search Trees

Mid term review

12. AVL trees
13. Programing
14. Multi-way trees
15. B-trees
16. Red-black Trees
17. Merge sorts
18. Quick sorts
19. Graph ADT and DS
20. Graph traversals
21. Directed graphs
22. Weighted graphs
23. Huffman code
24. Strings and Dynmic Programming

Final Review