java_binary_tree_creation-search
A java script conducting a binary search that is first sorted using a binary search
A small java script to read in a text file that contains two arrays, a data and a query. A binary tree is created from the data array. Then the values from the query array are searched for within the tree.
Each method is timed, the output of each is shown along with the time it took to parse each query through the data array. The text file is read in through user command.
The format of the text files is as follows, where the first number on the first line is how many rows after the initial is in the data array, and the second number is how many rows following that which are in the query array: 5 2 95 62 166 113 182 94 82