Data Structures and Algorithms: BRIDGES

Access remote data through BRIDGES.

Manipulate a binary search tree using the earthquake magnitude (or some other attribute) as a search key

Traverse BST using different methods.

Open your base code.

Plug in your credentials.

Complete the insert_R() function to recursively insert objects into the binary search tree. You should insert objects based on the magnitude of the earthquake.

Perform a traversal on the completed BST.

Perform a binary search to find the biggest earthquake based on magnitude and color it red.

Your BSTElement will use EarthquakeUSGS as the generic parameter, using Double as the key type. The key is will be the magnitude of the earthquake.

Write an insert() method, creating and inserting earthquake records into a binary search tree, using the magnitude of the quake as a search key. Color the nodes less than 3.0 magnitude orange and the nodes greater than or equal to 3.0 magnitude green (10 points)

Color the root node in a unique color. (done for you)

Perform a traversal of the tree and color leaf nodes black. (10 points)

Traverse the tree to find the largest quake and style it RED. (5 points)

Once completed, submit your code and link to the visualization. (2 points)