Information on how the 1st part of the project is evaluated:
1. The data structure for the rectangles (4 points):
    1.1. the names of the rectangles (1 point);
    1.2. the locations of the rectangles (1 point);
    1.3. an efficient data structure supporting queries based on names (2 point):
        1.3.1. get full 2 points if using a binary search tree;
        1.3.2. only 1 point if other data structure less efficient but still effective (e.g., a linked list);
2. The data structure for the quadtree (6 points):
    2.1. the references to the four children (quadrants) (3 points);
    2.2. the data field for the r-piece information (e.g., a pointer to a rectangle structure) (3 points);
    2.3. the type of the node (gray, black or white): not necessary so 0 point;
3. Other auxiliary structures (0 point):
    The main task of the first assignment is to select data structures needed to implement Rectangle quadtrees and all operations.
    As a result, it does not matter whether you use other structures and how you use them.
    E.g., you may use a point(x, y) structure to represent ordered pairs, or you can just write two integers in your structure.
    These structures therefore are not given points.
4. Adequate comments and explanations (up to 0.5 point):
    4.1. If your comments help the grader quickly understand what your code means, then up to 0.5 point will be added.
    4.2. However, the total score of the assignment will not exceed 10 points.
All above is the final standard of the evaluation.
The assignments will be returned on Sep 5th. If you have questions, please contact the TA.
Really sorry for score alterations (because the standard was changed during the grading process) on your assignments.