listing continued node newright new node()/make new node if(thisnode==root/if this is the rootroot new node()/make new root parent root/root is our parent root connectchild( thisnode)/connect to parent else /this node not the root parent thisnode getparent()/get parent /deal with parent itemindex parent insertitem(itemb)/item to parent int parent getnumitems()/total itemsfor(int = - >itemindexj--/move parent' /connections node temp parent disconnectchild( )/one child parent connectchild( + temp)/to the right /connect newright to parent parent connectchild(itemindex+ newright)/deal with newright newright insertitem(itemc)/item to newright newright connectchild( child )/connect to and newright connectchild( child )/on newright /end split(//gets appropriate child of node during search for value public node getnextchild(node thenodelong thevalueint /assumes node is not emptynot fullnot leaf int numitems thenode getnumitems()for( = <numitemsj++/for each item in node /are we lessifthevalue thenode getitem(jddata return thenode getchild( )/return left child /end for /we're greaterso