Topics for the third examination include, but are not necessarily limited
to, the following:

Trees
	Avl trees
		insertion
		deletion
		search
		traversal
		advantages, disadvantages
	RedBlack trees
		insertion
		rotation
		traversal
		search
		advantages, disadvantages
	2-3-4 trees
		insertion
		traversal
		search
		top-down 2-3-4 trees
	B-trees
		insertion
		traversal
		search
Direct access files
	ofstream, ifstream, fstream, etc
	seekp, seekg, tellp, tellg, etc
	write some program code
Graph Theory
	data structures
	algorithms
		visitation
		A squared
		floyd