BinarySearch tree

The following code (studied in class) is part of the code for deleting a node from a binary search tree for the case where neither of the two sub-trees of the deleted node is empty. This code replaces the deleted item by the largest item in the left sub-tree. // Neither subtree is empty. Find largest element of left subtree Node LargestParent toBeRemoved; Node largest - teBeRemoved.getLeft(); while (largest.getRight() != null) { largestParent = largest; largest = largest.getRight(); 1 toBeRemoved.setData (largest.getData()); if (largest Parent == toBeRemoved) 1 largest Parent.setLeft (largest.getLeft(); } else largest Parent.setRight largest.getLeft 0);} Modify this code so that it replaces the deleted item with the smallest item in the right sub-tree instead of replacing it with the largest item in the left sub-tree. Similar to the above code, your modified code should be iterative (using a loop) and not recursive