Submit a complete implementation called LinkedBST it must implement the BinarySearchTree interface completely using java.public interface BinarySearchTree<E> { /** * Add a value to this tree following the BST algorithm * Values to the right of a node are greater than the node value * Values to the left of a node are less than the node value * @param value The value to add */ public void add(E value); /** * Remove a value from this tree * @param value The value to remove */ public boolean remove(E value); /** * Returns true if this tree contains the specified element. * @param value value whose presence in this tree is to be tested * @return true if this list contains the specified value */ public boolean contains(E value); /** * Returns true of this tree contains no values * @return true of this tree contains no values */ public boolean isEmpty();}
Expert Answer
Answer to Submit a complete implementation called LinkedBST it must implement the BinarySearchTree interface completely using jav…