CS111 Test III Topics to cover and coding review problems

Topics/practice
  1. Know the terminology for a Binary Search Tree.
  2. Know how to implement a Binary Search Tree. Know how to code the scenarios for adding a node to the tree. Know how to code the scenarios for deleting a node from the tree.
  3. Know how to traverse a Binary Search Tree.
  4. Know how to write a comparable class to represent a Tree Node.
  5. Know the difference between a TreeSet and a TreeMap. Know how to work with both.
  6. Know how to work with a Map (HashMap).