Review for Final Exam COSC 3327  

1. Know how to compute an array address.

2. Know order of magnitude for ALL data structures
we have studied, used.

3. Know the 5 sorting routines basic advantages from lab 2.
(which is better in what situation.)

4. Know advantages/disavantages of all data structures we have studied. 

5. Be able to add items to a B-tree, splitting it as needed.

6. Be able to compute the branching factor of a B-tree given the
   appropriate information such as block size and key size.

7. Be able to traverse a tree in pre, post, level order.

8. Be able to add/rotate an AVL tree.

9. Be able to recurse through a binary tree in either inorder, preorder
or postorder.