Topics to be included on the second examination include, but are not
necessarily limited to, the following:

1. Linked structures
2. Hashing. Linear probing. Quadratic probing.
3. Classes, wrapper classes, standard template libraries.
4. Searching: sequential search
5. Searching: binary search
6. Searching: Hashing
7. Searching: Trees
8. Searching: AVL trees
9. Searching: red-black trees
10. Advantages, disadvantages, insertion algorithms, deletion
algorithms, searching algorithms, overhead, computational 
complexity
11. General algorithms: tree rotations, single rotation, double 
rotation, traversals, inorder, preorder, postorder, level, height,
depth, leaves, size, etc.

As usual, some code will be required, some pencil calculations, and
some explanations of the theory.