You are implementing a binary search tree class from scratch, which, in addition to insert, find, and delete, has a method getRandomNode() which returns a random node from the tree. All nodes should be equally likely to be chosen. Design and implement an algorithm for getRandomNode, and explain how you would implement the rest of the methods

There is no arrayTree or testTreeADT description!!!!! 1. Problem DescriptionYou are to develop a program that plays the perfect game of TicTacToe. It should never lose. Yourproject can be done in three steps of increasing complexity. Develop the Tree ADT as an array-based concreteimplementation. For the program, there is no code to start with; you are to develop everything. However, the UMLdesign and test drivers for the Tree ADT have been supplied so you can test your implementation. You canreview the sample output below to get an idea of the interaction. Create the Array-based Tree ADT. Run it with TestTreeADT.java to insure it works.

Write a code to implement binary search tree. Implement all the methods, find, insert, delete, minimum, max, find successor. Test out all the methods.

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 //            .../ \.....                         ......./ \... //           /…

Write a method isBST() that takes a Node as argument and returns true if the argument node is the root of a binary search tree, false otherwise.Hint : This task is also more difficult than it might seem, because the order in which youcall the methods in the previous three exercises is important

Please, use Java and write a clear answer to your own work and I'll rate up. Thank you :)

ll data members must be declared as private. Global variables are not allowed. Constants are ok. There should be no usage of cin or cout in the method or in the class definition or required functions. They should be handled using parameters and return values. cin and cout can and should be used in the testing functions. There should be only one “return” statement in a function or method. Multiple return statements within the same function/method are not allowed. Please pay attention to the required data types in the description. tuple, list and vector classes are not allowed to be used in this exam. Please write C++ functions, class and methods to answer the following questions. 1. Define a new C++ class named “Exam” that manages simple exam information: student id (integer) and a score (integer) The class must provide at least the following two methods: • isPassing which will return a boolean: true if the score is >=60 and false otherwise • toString method that returns the string…