{ return (numitems==order-1) true : false; }
public int finditem(long key) // return index of
{ // item (within node)
for(int j=0; j { // otherwise,
if(itemarray[j] == null) // return -1
break;
else if(itemarray[j].ddata == key)
return j;
}
return -1;
} //end finditem
public int insertitem(dataitem newitem)
{
//assumes node is not full
numitems++; // will add new item
long newkey = newitem.ddata; //key of new item
for(int j=order-2; j>=0; j–) //start on right,
{ //examine items
if(itemarray[j] == null) //if item null,
continue; //go left one cell
else // not null,
{ // get its key
long itskey = itemarray[j].ddata;
if(newkey < itskey) //if its bigger
itemarray[j+1] = itemarray[j]; //shift it right
else
{
itemarray[j+1] = newitem; //insert new item
return j+1; // return index to
} // new item
} // end else (not null)
} // end for //shifted all items,
itemarray[0] = newitem; //insert new item
return 0;
} // end insertitem()
public dataitem removeitem() // remove largest item
{
// assumes node not empty
dataitem temp = itemarray[numitems-1]; // save item
itemarray[numitems-1] = null; //disconnect it
numitems–; //one less item
return temp; //return item
}
public void displaynode() //format “/24/56/74/”
{
for(int j=0; j itemarray[j].displayitem(); // “/56″
System.out.println(“/”); // final “/”
}
} //end class node
|