Homework 9 Grading Guide

  1. 10 points: Just check for correctness
  2. 25 points: Check for the following

  3. 25 points: Test with both BinaryTreeDriver.py and with a different program that creates objects and inserts them into the binary tree. You will need to modify BinaryTreeDriver.py so that it creates objects and so that it defines a comparator function for those objects.
  4. 40 points: Look for the following elements:
    1. 30 points: The handicaps are correctly computed
    2. 5 points: The handicaps are sorted in ascending order (subtract 3 points if they're in descending order)
    3. 5 points: The handicaps are padded to 5 characters and have 2 decimal points.