Computer Science 261

Exam 3 Review

DRAFT

Please note that while I do try to be comprehensive in these exam reviews, all of the material covered is fair game.  Of course, if you notice that I've left something important out, please let me know as quickly as possible.

• Be able to implement a stack or a queue as a list structure 
• Be able to insert, delete, and list a sorted linked list.
• Be able to traverse a binary tree
• in order
• preorder
• postorder
• and recover a binary tree from an inorder traversal together with a preorder or a postorder traversal.
• Be able to search and insert in a binary search tree, and to outline or diagram the deletion process.
• Be able to say what a loop invariant is, do any of the O(n^2) sorts and say what the loop invariant for the outer loop of each is.  Be able to say something more about O(log(n)), O(n), O(n*log(n)), O(n^2), etc.
• I forgot to add the material on recursion and stack frames.  This will not be on exam #3, but may be covered on the final exam.