Write a program that takes an integer N from the command line, builds a random BST of size N, then enters into a loop where it deletes a random key (using the code delete(select(StdRandom.uniform(N)))) and then inserts a random key, iterating the loop N 2 times. After the loop, measure and print the average length of a path in the tree (the internal path length divided by N, plus 1). Run your program for N = 102, 103, and 10 4 to test the somewhat counterintuitive hypothesis that this process increases the average path length of the tree to be proportional to the square root of N. Run the same experiments for a delete() implementation that makes a random choice whether to use the predecessor or the successor node.

Removes the node with the lowest value from the binary search using Java code. tree and delivers a reference to an element inside it. If this tree is empty, an EmptyCollectionException is thrown. If the tree is empty, returning a reference to the node with the least value produces an EmptyCollectionException.

In this problem, we need to create a method capable of calculating the distance  between the deepest node on the left to the deepest node on the right. However my code is struggling to even output my binary search tree, and I am not sure how to code the method. Can someone please explain how I could code this?/////////////////////////////////////////////////////////////////////////// // // Pro3105 // //      Write a program that creates a binary search tree of 15 to 30 //      random Capital Letters. // //      Define the tree width operation by writing the method that will //      calculate the distance from the deepest node of the left subtree //      to the deepest node of the right subtree. // //                           K //                  ......../ \.......................... //                 /                                     \ //                H                                       U //            .../ \.....                         ......./ \... //           /…