//T2

//  Final Exam (see webpage): presumably THU 16 AUG  PM 2-5  STVLAD

//  A4 Posted
//  A4 tutorial this Fri 11-12pm in BA1230 (note the unusual place). 
//  Make sure to read the handout before going to the tutorial

// Office hours for A4:
//    * Mon July 23 12-1pm
//    * Wed July 25 1-2pm
//    * Mon July 30 12-1pm
//    * Tue July 31 3-4pm
//    * Wed Aug 1 1-2pm
//    * Mon Aug 6 8-9am
//    * Tue Aug 7 8-9am

//reviewed BST insert/contains/delete

non-recursive min: finding minimum node in tree t:
      while( t.left != null) {
        t = t.left
      }
      return t.key;
      
 non-recursive contians: finding k in tree t:
    
    
      while (t != null && t.key.compareTo(k) != 0) {
        if (t.compareTo(k) < 0) 
          t = t.right;
        else 
          t = t.left;
      }
      if (t == null)
        return false;
      else
        return true;