Exam 2 Topics:
*******************************************************


Module 4: Recursion
=================================

Typical Structure
Two Questions For Constructing Recursive Solutions
Iteration vs. Recursion (when to use each)
Binary Search
Fibonacci Number
Tower of Hanoi
Making Change


Module 5: Trees
=================================

Tree Terminology
ADT Binary Tree
Implementations of Binary Tree ADT
+ Array
+ Pointer-based
Binary Tree Traversals
Binary Search Tree
+ ADT
+ Advantages / disadvantages
+ Insertion
+ Deletion
+ Retrieval
+ Big-Ohs (Insertion, deletion, retrieval, traversal)
AVL Trees
+ Advantages / disadvantages
+ Insertion
+ Deletion
+ Retrieval
+ Big-Ohs (Insertion, deletion, retrieval, traversal)
Splay Trees
+ Advantages / disadvantages
+ Insertion
+ Deletion
+ Retrieval
+ Big-Ohs (Insertion, deletion, retrieval, traversal)


Module 6: Priority Queues & Heaps
=================================

Priority Queues & Heaps
-----------
Advantages
Definition for validity
Operations and their run times
+ Insert
+ Top
+ Pop
+ BuildHeap