EmptyBST.java

package assn04;


import java.util.Queue;

public class EmptyBST<T extends Comparable<T>> implements BST<T> {

    @Override
    public BST<T> insert(T element) {
        return new NonEmptyBST<T>(element);
    }

    @Override
    public BST<T> remove(T element) {
        return this;
    }

    @Override
    public int getHeight() {
        return -1;
    }

    @Override
    public void printPreOrderTraversal() {
        return;
    }

    @Override
    public void printPostOrderTraversal() {
        return;
    }

    @Override
    public void printBreadthFirstTraversal() {

    }

    @Override
    public BST<T> getLeft() {
        throw new UnsupportedOperationException();
    }

    @Override
    public BST<T> getRight() {
        throw new UnsupportedOperationException();
    }

    @Override
    public T getElement() {
        throw new UnsupportedOperationException();
    }

    @Override
    public boolean isEmpty() {
        return true;
    }

    @Override
    public void printBreadthFirstTraversal2(Queue<BST<T>> q) {

    }

}