Added files, began attempting to implement the kd data structure. However, errors abound during class creation.
Merge pull request #1 from db4soundman/master

Added files, began attempting to implement the kd data structure. Howeve...
Thanks to Dr. Brinkman, the class setup is building correctly. Now, to implement the methods.
Retooled the header files, implemented all methods, can't read in the file for some reason. Will see Dr. Brinkman today.
Made the load file time quicker by changing how I check for duplicates.
Changed how next and prev were implemented to help figure out the nearest Starbucks location. Still not perfect but made the error percentage decrease by a factor of 10.
Random tests now use full range of lat and long
Merge pull request #2 from MiamiOH-CSE274/master

Random tests now use full range of lat and long
Added a new distance method for ease of calculation while finding the nearest Starbucks, and began building the recursive method.
Finished the find nearest method and updated the header in the .h file... I get a bad memory access but I'm not sure why based on my code... need to take a break though.
Changed my distance method slightly so that it worked correctly.
Changed getNearest to reflect the way I implemented my searching algorithm.
Moved everything out of the.ipp file and into the header file for debuggin purposes.
Simplified the getNearest method.
Realized that my add function was deleting some points unnecessarily. Also, redefined the remove method so that it gets the job done quicker, per Dr. Brinkman's advice. Operating at 1.04ms per search with a 0 error percentage. I hope this stands up to the real tests.
Had to redefine the method header for remove.
Removed unnecessary methods.
Filled out the Readme file.
Removed the call to key Exists, since it is no longer a valid funciton of my kd-tree.
Delete BST.ipp

Don't need this file, as everything is in the .h file now.