code: private void rightAddNoSuccessor(
                                      GBSNode           p,
                                      Object            new1,
                                      NodeInsertPoint   ip,
                                      InsertNodes       point)
      {
          if (p.lessThanHalfFull())      /* Node not even half full so the insert */
                                         /*  point now is high key of current     */
              point.setInsert(p, p.rightMostIndex());
          else                           /* Keys exist beyond the median          */
          {
              /* Must look for insert point            */
              p.findInsertPointInRight(new1, ip);
              point.setInsert(p, ip);
          }
      }
docs: Add to right side with no upper successor present.
  
  <p>There is no upper successor.  If key exists it is in right part
  of current node.  If curent node is less than half full there can
  be no duplicate because the last compare that got us here was with
  the right-most key in the current node.</p>
  
  @param p Current node from which we tried to move left
  @param new1 Key being inserted
  @param ip Scratch NodeInsertPoint to avoid allocating a new one
  @param point Returned insert points