listing trees and external storage continued return (childarray[ ]==nulltrue false/public int getnumitems(return numitems/public dataitem getitem(int index/get dataitem at index return itemarray[index]/public boolean isfull(return (numitems==order- true false/public int finditem(long key/return index of /item (within nodefor(int = <order- ++/if found/otherwiseif(itemarray[ =null/return - breakelse if(itemarray[jddata =keyreturn jreturn - /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 =order- >= --/start on right/examine items if(itemarray[ =null/if item nullcontinue/go left one cell else /not null/get its key long itskey itemarray[jddataif(newkey itskey/if it' bigger itemarray[ + itemarray[ ]/shift it right else itemarray[ + newitem/insert new item