// Helene Martin, CSE 143
// Creates a binary search tree of integers.

public class IntSearchTreeClient {
	public static void main(String[] args) {
		IntSearchTree tree = new IntSearchTree();
		tree.add(55);
		tree.add(29);
		tree.add(-3);
		tree.add(42);
		tree.add(87);

		System.out.println(tree.getMin());
		tree.remove(-3);
		tree.remove(29);
		tree.remove(55);
		// add case where min is only right node
	}
}