// CSE 143, summer 2012
// Creates a BST of integer, prints its elements, checks 
// whether particular elements exist in the tree and adds and 
// removes elements

public class SearchTreeClient {
	public static void main(String[] args) {
			
		SearchTree tree = new SearchTree();
			
		tree.add(42);
		tree.add(3);
		tree.add(2);
		tree.add(56);
		tree.add(97);
		tree.add(48);
		
		tree.print();
		System.out.println();
		
		System.out.println(tree.contains(42));
		System.out.println(tree.contains(56));
		System.out.println(tree.contains(48));
		System.out.println(tree.contains(7));
		System.out.println(tree.contains(62));
		System.out.println(tree.contains(43));
		
		tree.remove(48);
		tree.print();
		
		tree.remove(3);
		tree.print();
		
		tree.remove(42);
		tree.print();
	}
}