search( key, t )
     typekey key;
     tree t;
     {
     while( t != NULL )
          if ( t->k == key )
               { found( t ); return; }
          else if ( t->k < key ) t = t->right;
                    else         t = t->left;
     notfound( key );
     }