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$).(10$ points$)$ All groups.

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

$3.$ UsealsoAVLtree,red$-$blacktreeforthesamethingsinitems$1$and$2.(10$ points$)$

$4.$ Delete $(100$