12                             {
   13    String[] keys={"a","b","c","d","e","f","g","h","i"};
   14    int      n=keys.length;
   15 
   16    for (int[] p : new Permutations(n)) {
   17 
   18      A234Tree<String> tree=new A234Tree<String>(false);
   19 
   20      for (int i : p) {
   21        String k=tree.find(keys[i]);
   22        assertEquals(k,null);
   23        tree.insert(keys[i]);
   24        k=tree.find(keys[i]);
   25        assertTrue(k!=null);
   26        assertTrue(k.compareTo(keys[i])==0);
   27        tree.checkConsistency();
   28      }
   29 
   30      tree=new A234Tree<String>(true);
   31 
   32      for (int i : p) {
   33        String k=tree.find(keys[i]);
   34        assertEquals(k,null);
   35        tree.insert(keys[i]);
   36        k=tree.find(keys[i]);
   37        assertTrue(k!=null);
   38        assertTrue(k.compareTo(keys[i])==0);
   39        tree.checkConsistency();
   40      }
   41    }
   42  }