import structure.*;
import com.mw.io.*;

class BTSearchDriver {
// A program that builds a binary search tree of n integers, searches for
// an integer in the tree, and displays the elapsed time in milliseconds 
// for the search.

    public static void main (String args[]) {
      SystemInput sysIn = new SystemInput(); 
      BinarySearchTree data = new BinarySearchTree();

      ReadStream r = new ReadStream();
      System.out.println("Enter an integer for the tree size:");
      int n = r.readInt();

      for (int i=0; i<n; i++)
        data.add(new ComparableInt(i+1));  // add next integer to the tree
        
// Now read an integer for the search
      System.out.println("Enter an integer for searching this tree: ");
      ComparableInt x = new ComparableInt(r.readInt());

// Now search for that integer in the binary tree data
      long t = System.currentTimeMillis();
      ComparableInt y = (ComparableInt)data.get(x);  // see if x is there or not
      long u = System.currentTimeMillis();
      if (y==null) 
         System.out.println(x + " not found :-(");
      else 
         System.out.println(x + " found :-)");
      System.out.println("Elapsed search time = " + (u - t) + " milliseconds");
    }
}