COMP 2503 Task 4 Fall 2021 This is a temporary work document to save and modify your responses. Once you have completed the questions and are ready to submit, copy and paste your responses into the...

Simple just fill methods and turn to BST


COMP 2503 Task 4 Fall 2021 This is a temporary work document to save and modify your responses. Once you have completed the questions and are ready to submit, copy and paste your responses into the google form. Emailed submissions of this document will not be accepted. Reminder: Check the task rubric to see how you will be marked and hints at important things to include Total marks 20 Tasks are due on the date and time indicated. Any late tasks will lose 10% per day (including weekends) and no assignments will be accepted after 5 days late. Due: Wednesday Nov 24th, Weight: 11% If you need an extension you must email me no later than Nov 22nd, extentions will only be given in extreme cases. For the questions below you, will need to import all the provided code into a single project and make sure that Junit has been added to the project. Question 1 - Part 1 [15 marks] BST coding question Implementing a generic Binary search tree You have been provided with a skeleton class that will implement a generic Binary Search Tree. You also have been given a Junit testing class that covers a range of tests to verify that the tree has been implemented properly. For this question, you will have to complete the following methods and have all the tests pass and be efficient. Above each method you will find documentation that describes what each method must do.  [1 mark ] - getSize()  [4 marks] - void add(keytype key, datatype data)  [2 marks] - containskey(keytype key)  [2 marks] - find(keytype key)  [4 marks] - remove(keytype key)  [2 marks] - void clear() Question 1 - Part 2 [5 marks] using a BST question For this question, you will be modifying a small program that currently uses an ArrayList to store information to now store the data in the BInarySearchTree you created in Question 1. In the package ContactSystem, you will find a small program that allows a user to add, remove, and update a list of contacts (name, email, ect..). You must modify the program to now switch the storage of the contact information from an Arraylist to a binary search tree. Note: Code found in the exampleTreeProgram package demonstrates how to use different features of the BinarySearchTree class.