public void insertBEntry(BEntry ent){
  if (!hasSpace()) {
    throw new BPlusTreeException("Node should have split before; Currently is full");
  }
  List<BEntry> entries=getAllValidEntries();
  entries.add(ent);
  Collections.sort(entries);
  overwriteBNodeEntries(entries);
  if (!hasSpace()) {
    splitNode();
  }
}

public void insertBEntry ( BEntry ent ) { if ( ! hasSpace ( ) ) { throw new BPlusTreeException ( "Node should have split before; Currently is full" ) ; } List < BEntry > entries = getAllValidEntries ( ) ; entries . add ( ent ) ; Collections . sort ( entries ) ; overwriteBNodeEntries ( entries ) ; if ( ! hasSpace ( ) ) { splitNode ( ) ; } }
inserts an entry into this node . note that we split this node immediately after it becomes full rather than when trying to insert an entry into a full node .
