exam2 Topics
-----------------------------------------------------------------------------
1.3	Recursion
	+ Typical Structure
        + Four Questions For Constructing Recursive Solutions
	+ Iteration vs. Recursion
	Tower of Hanoi

2	Algorithm Analysis
	Measuring the efficiency of algorithms
	+ Growth-rates
	+ Big-Oh Notation
	+ Properties of Growth-rate Functions
	+ Common Growth Rates
	+ Worst-case vs. Average-case analysis
	+ Big-Theta
	Sequential Search vs. Binary Search

4.0-4.3	Tree Terminology
	ADT Binary Tree
	Implementations of Binary Tree ADT
	+ Array
	+ Pointer-based
	Binary Tree Traversals
	ADT Binary Search Tree
	Efficiency of Balanced Search Tree Algorithms
4.4	AVL Trees
4.5	Splay Trees
4.7	B-Trees