public static int height1 (Tree T) {
     int h = 0;
     Iterator positer = T.positions();
     while (positer.hasNext()) {
       Position v = (Position) positer.next();
       if (T.isExternal(v))
	 h = Math.max(h, depth(T, v));
     }
     return h;
   }