public class BinarySearchTree<E extends Comparable<E>>{
	private TreeNode<E> root;

	public BinarySearchTree(){ root = null; }

	public boolean contains(E value){ return false;	}
	public boolean add(E value){ return false; }
	public void print(){}
	public E minimum(){ return null; }
	public E maximum(){ return null; }
	public E successor(E value){ return null; }
	public E predecessor(E value){ return null; }

	public static void main(String[] args){
		BinarySearchTree<Integer> tree = new BinarySearchTree<Integer>();
		for( int i=0; i<50; i++ ){
			Integer x = new Integer((int)(Math.random()*10000));
			tree.add(x);
		}
		tree.print();
	}
}