Reference no: EM131592024

This is Java, not c++, and please do as what requires. Thank you very much! And source code needed is provided below the description.

Binary Search Tree
Implement the BinarySearchTree class. The BinarySearchTree class extends the BinaryTree class which implements the Tree interface. All can be seen here. Your assignment is to implement all of the abstract methods of the BinaryTree class recursively.
They are:
Insert.
Iterator (non-recursive).
Remove.
Search.
You must also implement an Iterator inner class for the BinarySearchTree class. You must submit a modified BinarySearchTree.java file with your source code.
Do not submit and do not modify the Tree.java or BinaryTree.java files.

Code:
/*
*
* Tree.java
*
*/

public interface Tree<E> extends Iterable<E> {
void insert(E data);
void remove(E key);
boolean search(E key);
}

/*
*
* BinaryTree.java
*
*/

public abstract class BinaryTree<E> implements Tree<E> {

protected class Node<T> {
protected Node(T data) {
this.data = data;
}
protected T data;
protected Node<T> left;
protected Node<T> right;
}

protected Node<E> root;
}

/*
*
* BinarySearchTree.java
*
*/

import java.util.Iterator;

public class BinarySearchTree<E extends Comparable<? super E>> extends BinaryTree<E> {

public void insert(E data) {
return;
}

public Iterator<E> iterator() {
return null;
}

public void remove(E key) {
return;
}

public boolean search(E key) {
return false;
}
}