GIVEN THE JAVA CODE BELOW:

Implement a Black-Red Tree which support search and insertion: a class with two operations search , insertion and delete with a main method to test the operations.

public class BinarySearchTreeClass /* Find the deleting node (current) / if (root == null) System.out.println("It is empty!"); while (current != null && current.item != KEY) public Node root; public Binary SearchTreeClass() root = null; parent = current; if (KEY