This is a project done for Coursera's Algorithims Part 1 course from Princeton.
It is meant to show how a binary search tree can halp improve the efficiency of finding the nearest point to another point in a 2D plane and finding all the points within a given 2D area.