Syllabus

	Data Structures and Abstractions with Java by Frank Carrano

Course Outline (though not necessarily in this order):

Review of the principles of Object Oriented Programming	Implementation of binary trees
Basic Complexity Analysis	Tree traversals
Linked Lists	Balancing trees
Variations: Circular Lists, Doubly linked lists, Skip lists	Multi-way trees
Stacks	Graphs
Queues	Graph Traversals
Priority Queues	Shortest Paths
Recursion	Spanning trees
Backtracking and Divide and conquer	Topological Sort
Binary Trees	Sorting
Binary search trees	Hashing