# Binary Trees

## Overview

For this assignment we will be working polling data for the upcoming 2020 U.S. presidential election. Before the two main political parties put forward their nominees for president, the Democratic and Republican parties hold primary elections to determine who their nominee will be. The Republican nominee is essentially predetermined to be President Trump. The Democratic party is converging on a decision, but over the past year or so, the outcome has been very uncertain. In order to make repeated predictions about the likely outcome of the Democratic party nomination, pollsters (statisticians) regularly conduct polls (surveys) to sample Democratic primary voters and ask who they plan to vote for. These results are compiled, released, and eagerly tracked by the news media and public to determine which candidate currently has the largest percentage of support.

In this assignment, your job will be to take the poll results given as input via CSV files and update the entries of a binary tree so that it stores the name and current polling percentage for each candidate. There is an optional part at the end to look at the “evolution” of the candidates over time.

## Part 1: Implementing a Binary Tree

You should start by implementing the given BinaryTree interface as a LinkedBinaryTree so that generic objects that implement the compareTo method from the Comparable interface can be inserted into your tree. Requirements are shown below, and then some tips for each method.

### Requirements

1. Implement the BinaryTree interface as a LinkedBinaryTree. Make sure the implementation is entirely recursive and is a linked data structure, i.e., you should not use any for or while loops, arrays, ArrayLists, etc. Hint: you may find it useful to use private or public helper methods that are called from the publicly defined methods in the interface. Note that the data structure itself should be recursive. In other words, the left and right children of a tree should themselves be trees. You should not have a Node class.

2. Your implementation should be properly encapsulated, i.e. no implementation details should be made visible outside of the LinkedBinaryTree class. The user should not need additional methods to use the methods in BinaryTree interface (even if you implement extra public methods).

3. Insertion should be done using the compareTo method of the given element so that smaller elements are put into the left subtree and larger element are put into the right subtree. Insertion of elements that are already in the tree should replace the current element. When you put your polling data into the tree this will be equivalent to updating the poll numbers for a candidate. (In reality we should also delete candidates who have dropped out, but we’ll omit this for now unless you do the optional extension.)

4. As part of implementing the BinaryTree interface you will implement all three orders for tree traversal. Your returned string should be in the form:

element1 element2  ... elementn

Where the order is determined by the correct order for the specific traversal. Note that these methods should also use a recursive design. There should be one space between each element. This can be a bit tricky - look up the trim() method for Strings, which may help.

1. You should Override the toString method to return a String that looks like the following (use \t for tab):
Tree:
Pre:    b a c
In:     a b c
Post:   a c b

Where the first traversal is a pre-order traversal, the second is in-order, and the last is post-order.

### Method Summary

• Constructor: think back to what we did for our Node constructors (in terms of how to initialize the left and right trees of “this” tree). Before any elements are inserted, it’s okay for the data to be null.

• void insert(E element): should be fully recursive. Hint: you may need to initialize the left and right trees as data is added.

• E getRootElement()

• int size(): many ways to do this. Think about the pros and cons of maintaining an instance variable vs. computing size each time. Hint: no loops!

• boolean isEmpty()

• String toStringInOrder(): should be fully recursive. Hint: look up the trim method for strings.

• String toStringPreOrder(): same advice as in-order.

• String toStringPostOrder(): same advice as in-order.

### Examples

These examples are based on our in-class examples (second one is not exactly the same since it wasn’t sorted in class).

// testing in main
intTree.insert(8);
intTree.insert(11);
intTree.insert(5);
intTree.insert(17);
intTree.insert(1);
intTree.insert(9);
intTree.insert(3);
System.out.println(intTree);
// output
Tree:
Pre:    8 5 1 3 11 9 17
In:     1 3 5 8 9 11 17
Post:   3 1 5 9 17 11 8
// testing in main
letterTree.insert('A');
letterTree.insert('C');
letterTree.insert('G');
letterTree.insert('B');
letterTree.insert('D');
letterTree.insert('G'); // inserting again, should replace
letterTree.insert('F');
letterTree.insert('E');
letterTree.insert('H');
letterTree.insert('I');
System.out.println("size:" + letterTree.size());
System.out.println(letterTree);
// output
size:9
Tree:
Pre:    A C B G D F E H I
In:     A B C D E F G H I
Post:   B E F D I H G C A

## Part 2: Storing Polling Data

The polling data you are given will include the candidate’s full name, their last name, and the percentage of the people polled who said they would vote for that candidate.

### Requirements

1. Create a class to store one row of the polling data (think about an appropriate name for this class).

2. Have your created class implement the Comparable interface so that polling data objects are put in order based on the candidate’s last name.

3. Override the toString method to return a String with the following formatting (for example):

Elizabeth Warren:17.4

where full name is first, then a colon, then the candidate’s polling percentage.

## Part 3: Getting Polling Data from CSVs

The website FiveThirtyEight makes polling data for presidential primary candidates available. We have preprocessed this data for you so that only the relevant data is included and you will receive one file per conducted poll.

Each polling data CSV has the following format:

answer,candidate,pct
Bennet,Michael F. Bennet,1.3
Biden,Joseph R. Biden Jr.,23.8
Bloomberg,Michael Bloomberg,1.8
Buttigieg,Pete Buttigieg,8.1
Gabbard,Tulsi Gabbard,3.1
Klobuchar,Amy Klobuchar,4.2
Patrick,Deval Patrick,0.0
Sanders,Bernard Sanders,30.8
Steyer,Tom Steyer,0.0
Warren,Elizabeth Warren,17.4
Yang,Andrew Yang,0.7

The first column gives the last name of the candidate, the second column gives the candidate’s full name, and the final column is the percent the candidate is polling at in this poll. Note that the given percent can be a floating-point number. Recall from previous labs that you can read in data from a file using the OpenCSV library CSVReaderHeaderAware. You should feel free to do that for this lab as well.

Each file is named something like dempres_20190310_1.csv where dempres indicates that these are polling results for the Democratic party presidential primary, 20190310 indicates that the polling results were completed on March 10, 2019, and _1 indicates that these are the results for the first poll completed on that date (there may be multiple from different sources). I have included about one file for each month, so you can see the evolution of the candidates.

Your job is to take the polling data in each file and insert it into the binary tree. Your resulting tree should contain the polling data for each candidate from the most recent date for which there is data from the files given on the command line. Each polling result will only include some of the candidates.

### Requirements:

1. Take filename input from the command line into the main method of your Main.java. You may be given multiple filenames. An example of given arguments might be:

poll_data/dempres_20190103_1.csv poll_data/dempres_20190202_1.csv poll_data/dempres_20190302_1.csv

Edit: output from the above example

Tree:
Pre:    Bernard Sanders:21.1 Joseph R. Biden Jr.:37.0 Beto O'Rourke:5.0 Joseph Kennedy III:9.0 Kamala D. Harris:9.0 Hillary Rodham Clinton:3.0 Cory A. Booker:5.9 Michael Bloomberg:1.9 Sherrod Brown:0.9 Steve Bullock:0.0 Julián Castro:0.2 Pete Buttigieg:0.4 Kirsten E. Gillibrand:3.3 Andrew Cuomo:0.0 John K. Delaney:0.0 Eric Garcetti:0.0 Tulsi Gabbard:1.5 John Hickenlooper:1.0 Jay Robert Inslee:0.0 Eric H. Holder:0.0 John Kerry:1.0 Amy Klobuchar:0.9 Terry R. McAuliffe:0.0 Gavin Newsom:0.0 Richard Neece Ojeda:1.0 Elizabeth Warren:5.2 Tom Steyer:1.0 Howard Schultz:0.0 Eric Swalwell:0.0
In:     Joseph R. Biden Jr.:37.0 Michael Bloomberg:1.9 Cory A. Booker:5.9 Sherrod Brown:0.9 Steve Bullock:0.0 Pete Buttigieg:0.4 Julián Castro:0.2 Hillary Rodham Clinton:3.0 Andrew Cuomo:0.0 John K. Delaney:0.0 Tulsi Gabbard:1.5 Eric Garcetti:0.0 Kirsten E. Gillibrand:3.3 Kamala D. Harris:9.0 John Hickenlooper:1.0 Eric H. Holder:0.0 Jay Robert Inslee:0.0 Joseph Kennedy III:9.0 John Kerry:1.0 Amy Klobuchar:0.9 Terry R. McAuliffe:0.0 Gavin Newsom:0.0 Beto O'Rourke:5.0 Richard Neece Ojeda:1.0 Bernard Sanders:21.1 Howard Schultz:0.0 Tom Steyer:1.0 Eric Swalwell:0.0 Elizabeth Warren:5.2
Post:   Michael Bloomberg:1.9 Pete Buttigieg:0.4 Julián Castro:0.2 Steve Bullock:0.0 Sherrod Brown:0.9 Cory A. Booker:5.9 Tulsi Gabbard:1.5 Eric Garcetti:0.0 John K. Delaney:0.0 Andrew Cuomo:0.0 Kirsten E. Gillibrand:3.3 Hillary Rodham Clinton:3.0 Eric H. Holder:0.0 Jay Robert Inslee:0.0 John Hickenlooper:1.0 Kamala D. Harris:9.0 Gavin Newsom:0.0 Terry R. McAuliffe:0.0 Amy Klobuchar:0.9 John Kerry:1.0 Joseph Kennedy III:9.0 Richard Neece Ojeda:1.0 Beto O'Rourke:5.0 Joseph R. Biden Jr.:37.0 Howard Schultz:0.0 Eric Swalwell:0.0 Tom Steyer:1.0 Elizabeth Warren:5.2 Bernard Sanders:21.1
1. You should process the given files in increasing date order. You may assume that the files are given in this order.

2. Use your overridden toString method to print the tree after polling results from each new date are inserted. Thus, your resulting printed information should include one snapshot of the tree per given polling data CSV. Edit: you can just print the final tree at the end of all the files. Either way is fine, we’ll just be looking for the final tree somewhere in your output.

## Part 4: Runtime Analysis

1. Implement a boolean remove(E element) operation for the LinkedBinaryTree. It should return true if the element was in the tree and successfully removed and false if given an element that is not in the tree. You should be sure that this method works seamlessly with the other methods. For example, an in-order traversal should return a string containing the remaining elements in sorted order even after an element has been removed. Describe your chosen design for this method in the README.