Implementation of binary search tree in java

Question

Binary search tree in java

b) Implement a binary search tree in java that has the methods, add (), get (), min (), max ().
c) Then build a tree based on a log file. The tree must use the IP address as a key! Measure how long this takes for both small.log and large.log. TIP: System.nanoTime () i have these file in these file we have time sortet then ip and the file name

d) Then perform the following operations on the tree and measure the time each group takes for the "small.log and large.log file" these are text file which have a list in each list we have time-ip-file!

Group A: Check for the following IP addresses: 158.142.123.32, 209.34.182.63, 26.174.140.163, 157.230.186.58, 34.155.72.12, 128.148.68.247, 98.231.65.27, 16.192.128.249, 220.75.13.138, 140.167.51.71
in the files

Group B: Verify that the following IP addresses are not present: 158.142.123.2, 158.142.123.1, 209.34.182.3, 0.0.0.0 check if these ip addresses are in that two file for binary tree

Group C: Pick up and print the min and max values from the binary or the files

Answer 1

Please provide your code so that we can identify your problem.
👍https://www.sololearn.com/discuss/1316935/?ref=app