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

public class BSTClient {
	public static void main(String[] args) {
		BinarySearchTree tree = new BinarySearchTree();

		tree.add(55);
		tree.add(29);
		tree.add(-3);
		tree.add(42);
		tree.add(87);
		tree.add(91);
		tree.add(60);
		
		tree.print();
		
		System.out.println(tree.contains(29));
		System.out.println(tree.contains(55));
		System.out.println(tree.contains(63));
		System.out.println(tree.contains(35));
	}
}