I need code using Eclipse (Java) Please:

Implement a binary search tree of integers

1) Implement a set of 20 random integers between 1 and 100

2) Implement an unordered list from these integers

3) Implement a BST by adding each integer to the tree with smaller numbers to the left and larger to the right

4)Use recursion to output both the list and the BST

5)Repeatedly ask the user to pick a number between 1 and 100

6)Search both the list and the BST for the number and count how many processing steps are necessary in each case to either find the number or determine that the number is not in the set