You cannot submit for this problem because the homework's deadline is due.

Compile requirements

Please submit a zip or tar file containing kdtree.hpp. You don't need extra files for these test cases.
You must make sure that your code compiles successfully on a Linux operating system with g++ and the options -std=c++1z -Wconversion -Wall -Werror -Wextra -pedantic.

Test Case Specifications

These test cases are set to help you test your k-d tree implementations. For each test case, we test both the output of your implemented functions and the resulting k-d tree.

There're 50 pretest cases and 50 hidden cases in total. The former part of the cases will mainly focus on different operations of the tree, including find, findMin/findMax, delete, insert, copy, and iterator increment/decrement. The last few cases will mix everything together and have larger datasets. The hidden cases are mostly similar to pretest cases, but the dataset will be different.

Each case will worth 1 point for you and the total point is 100. Good Luck on your Project 3!