class TreeTest
{



   public static void main(String [] args)
   {
       TreeThree tt = new TreeThree() ;

       int i ;
       while ( (i=getPositiveInteger())>0 )
       {
          tt.insertToTree(i) ;
       } 
       tt.printTree() ;
   }



   static int [] testValues = { 10, 5,  15, 3, 7, 13, 17 } ;
   //static int [] testValues = { 1, 2, 3, 4, 5, 6, 7, 8, 9 } ;
   static int index = 0 ;
   static int getPositiveInteger()
   {
      // return 0 if no more integers
      if ( index< testValues.length )
         return testValues[index++] ;
      else
         return 0 ;
   }
}