95-771 Data Structures and Algorithms Carnegie Mellon University
1
95-771 Data Structures and Algorithms Project 2
Due: Tuesday, February 15, 2022, 11:59:59 PM
The objective of this assignment is to introduce the student to
binary search trees and related algorithms by building a
geometric application. This application will be based on 2d
trees.
Our primary source of information on 2d trees is from an
excellent video by Robert Sedgewick found at the following link.
All that you need to know about 2d trees for this assignment is
contained in this video.
https://www.youtube.com/watch?v=1OoM0phlO_U
The primary input to your application is a comma delimited text
file containing crime records from the Pittsburgh area. These
data were compiled during the 1990’s (an exceptionally high crime
decade in Pittsburgh). The file is named CrimeLatLonXY.csv and is
found on the course schedule.
For each crime record, the file contains (X, Y) coordinate pairs
in the state plane coordinate system. These (X, Y) coordinates
are useful for calculating the distance between points (using the
Pythagorean theorem). Each record also contains latitude and
longitude coordinates. These coordinates are useful for
displaying locations in GIS tools such as Google Earth. The other
fields are not so important for our purposes. However, all of the
data contained in the file will be represented in your tree.
The data structure that you will implement is a type of space-
partitioning tree called a 2d Tree. We will use this data
structure to store the crime records – you will store one crime
record per node in the tree. Be sure to view the video mentioned
above.
You will write several algorithms to manipulate the tree. These
algorithms will be methods found in your TwoDTree class. The
TwoDTree class will be found in a file name TwoDTree.java.
