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

public class IntSearchTreeClient {
   public static void main(String[] args) {
      // build a BST using the add method
      // use the jGRASP debugger to see add at work
      IntSearchTree tree = new IntSearchTree();
      tree.add(55);
      tree.add(29);
      tree.add(-3);
      tree.add(42);
      tree.add(87);
      tree.add(91);
      tree.add(60);

      tree.printSideways();

      // use the jGRASP debugger to see the different traversal orders
      System.out.print("Preorder: ");
      tree.printPreorder();
      System.out.println();

      System.out.print("Inorder: ");
      tree.printInorder();
      System.out.println();

      System.out.print("Postorder: ");
      tree.printPostorder();
      System.out.println();

      // test the contains method
      System.out.println(tree.contains(29)); // true
      System.out.println(tree.contains(55)); // true
      System.out.println(tree.contains(63)); // false
      System.out.println(tree.contains(35)); // false

      IntSearchTree tree2 = new IntSearchTree();
      tree2.add(42);
      tree2.add(5);
      tree2.add(55);
   }
}