public interface BinaryTreeInterface {
// Add newElement into the proper place in the tree
// Allows duplicate elements to be added!
public void addElement(OrderedObject newElement);
// Returns if an object that reports equality to
// object elem is contained in the tree
public boolean contains(OrderedObject elem);
// Allows for iteration through the tree
public java.util.Enumeration elements();
// Returns true if the tree is empty
public boolean isEmpty();
// Removes all elements from the tree
public void removeAllElements();
// Removes the first of object that reports
// equals(obj) to be true from the tree
// returns true if some instance was removed, false
// if no such instance was found.
public boolean removeElement(OrderedObject obj);
// Returns how many elements are in the tree
public int size();
}