Java code that eliminates the binary search's node with the lowest value. returns a reference to its element from a tree. If this tree is empty, it raises an EmptyCollectionException. If the tree is empty, returning a reference to the node with the fewest values produces an EmptyCollectionException.

1. Create a Java program that prompts the user the initial choices for the Binary Search Treea. User chooses 1: Insert, User chooses 2: Delete, User chooses 3: Show BinaryTree, User chooses 4: Exit Program   2. Insertion in a tree should be such that it obeys the main properties of the binary searchtree. The basic algorithm should be:a. If the node to be inserted is greater than the existing root, move down a levelthrough the right pointer of the root.b. If the node to be inserted is lesser than the existing root, move down a levelthrough the left pointer of the root.c. Repeat this process for all nodes till the leaves are reached.d. Insert the node as the left or right pointer for the leaf (based on its value - if it issmaller than the leaf, it should be inserted as the left pointer; if it is larger than theleaf, it should be inserted as the right pointer)   3. Deletion is a bit more complicated than insertion because it varies depending on the nodethat needs to be deleted from the…

What is the easiest way to fix a Node Constructor in my Java program? The current problem is it does not accept the Object being passed into it.

class IntBTNode {             private int data;             private IntBTNode left;             private IntBTNode right; } Write a new static method of the IntBTNode class to meet the following specification. Make the method as efficient as possible (do not visit nodes unnecessarily).   public static int max(BTNode root)      // Precondition: root is the root reference of a nonempty binary SEARCH     // tree.    // Postcondition: The return value is the largest value in the tree.