You will implement two data structures to store 1000 values. One will be stored in an array and another in a Binary Search tree. You will then implement a binary search on the array and compare it to a search of a binary search tree. You must generate the data structures with the data and timings must come from the program. You should produce at least 20 searches of varying input to report the results. You must also analyze the time to add new items while filling the data structure with items. Write a short report about what you found, how efficient was creating the structures and how efficient is the subsequent searches. Turn in a screen shot of the code, running program, and the short analysis.

NEEDS TO BE IN JAVA THANK YOU SO SO SO MUCH