Exam 3

There will be two programing question. The programing question will be in an enviroment identical to the PotDs. It will require programming complete and correct C++ programs. Partial credit will only be given for working, compilable code that passes some test cases. Code that doesnt compile will not receive any credit. Multiple (but not unlimited) submissions will be allowed. The programing questions will be the following.

• Make a Stack or Queue out of a std::list or std:vector
• Make an iterator on a tree

There is a practice for the iterator question can be found on PraireLearn

Topics Covered

---

• List, Stack and Queue ADT
• Binary Trees
  • Binary Tree (not a BST)
  • Binary Search Tree
    • Tree traversals
    • Operations: find, insert, and remove
  • AVL Tree
    • Balance factor
    • Tree rotations
    • Operations: find, insert, and remove
    • AVL applications (nearest neighbor; range finding)
• Iterators

Assignments referenced:

• mp_stickers, mp_lists, mp_traversals
• lab_debug, lab_memory, lab_quacks, lab_trees, lab_bst

Points:60

Start: Sunday, October 16

End: Tuesday, October 18