Using java

1. Generate a set of random numbers (10000, 100000, 1000000, try the maximum) between max and minimum integers (including negative values), insert them to a Binary search tree (BST).

2. Generate random number (10000, 100000, 1000000) and try to find these numbers in BST and report their execution times for each dataset.

3. Use also, red-black tree for the same things in items 1 and 2.

4. Delete (10000, 100000) random members from the BST and AVL tree, red-black trees. Report their execution times.