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

public class SearchTreeClient {
	public static void main(String[] args) {
		IntTreeNode root = new IntTreeNode(55);
		root.left = new IntTreeNode(29);
		root.right = new IntTreeNode(87);
		root.left.left = new IntTreeNode(-3);
		root.left.right = new IntTreeNode(42);
		root.right.left = new IntTreeNode(60);
		root.right.right = new IntTreeNode(91);
		
		SearchTree tree = new SearchTree();
		
	   tree.print();
		
		tree.add(42);
		tree.add(3);
		tree.add(2);
		tree.add(56);
		tree.add(97);
		tree.add(48);
		
		tree.print();
		
		System.out.println(tree.contains(29));
		System.out.println(tree.contains(60));
		System.out.println(tree.contains(91));
		System.out.println(tree.contains(7));
		System.out.println(tree.contains(62));
		System.out.println(tree.contains(43));
	}
}