package edu.buffalo.csel 16 16; Some updates could not be installed Install automatically. import java .util Abstractset; import java.util.Iterator; public class BinarysearchTree extends Abstractset protected BTNode roots protected int size Initializes this BinarysearchTree object to be empty to contain only elements of type E, to be ordered by the Comparable interface and to Contain no duplicate elements. public BinarysearchTree root null size 0 Initializes this BinarysearchTree object to contain a shallow copy of a specified BinarysearchTree object. The worst Time (n is O(n), where n is the number of elements in the specified BinarysearchTree object param otherTree the specified BinarysearchTree object that this BinarysearchTree object will be assigned a shallow copy of public BinarysearchTree (BinarysearchTree Solution JAVA CODE: PREDECESSOR FUNCTION:.