Write a java program to separately time Binary Search Tree insertion and deletion operation for 100, 1000, 10000 and 100000 items and print the result. Also, your program needs to print total insertion time and total deletion time for all the insertion and deletion scenarios.

You need to create two insertion and deletion methods. One with iterative approach and One with recursive approach and time each approach for above number of items.