import java.util.LinkedList;
import java.util.Queue;

public class BinarySearchTree_Placeholder<T extends Comparable<T>> implements SortedCollection<T> {

    protected BinaryTreeNode<T> root; // reference to root node of tree, null when empty

    public BinarySearchTree_Placeholder() {
        this.root = null;
    }

    public void insert(T data) throws NullPointerException { }

    protected void insertHelper(BinaryTreeNode<T> newNode, BinaryTreeNode<T> subTree) throws NullPointerException { }

    public int size() { if (this.root == null) return 0; else return 1; }

    public boolean isEmpty() { return this.root == null; }

    public boolean contains(Comparable<T> data) { return false; }

    public void clear() { }

}