import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;

public class BinarySearchTreeDemo
{
   public static void main(String[] args) throws IOException
   {
      BufferedReader keyboard = 
              new BufferedReader(new InputStreamReader(System.in));
      IntTree tree = new IntTree();

      System.out.print("Enter a list of nonnegative integers,");
      System.out.println(" one per line.");
      System.out.println("Place a negative integer at the end.");
      String nextNumberString = keyboard.readLine( );
      int next = Integer.parseInt(nextNumberString);
      while (next >= 0)
      {
          tree.add(next);
          nextNumberString = keyboard.readLine( );
          next = Integer.parseInt(nextNumberString);
      }

      System.out.println("In sorted order:");
      tree.showElements( );
   }
}