1. Midterm Exam Two Tuesday, November 25 st In class cumulative

2. Material Covered Linked Lists Stacks Queues Trees –Expression Trees –Binary Search Tree –Heap

3. Material Covered (cont) Sorts –Selection –Bubble –Insert –Merge –Quick –Heap (only binary heap)

4. Types of Questions Programming questions –Lists, Stacks, Queues –Trees No programming AVL trees –Heap –Sort

5. Types of Questions (cont) Show results of operations –Items from programming plus AVL Tree Short answer –Everything listed in programming and "show results" plus Big Oh (something very simple like the first midterm – i.e. where you can count the answer without a proof or something we have already discussed in class / recitation)