code: void findInsertPointInRight(
      Object           new1,
      NodeInsertPoint  point)
    {
      int r = rightMostIndex();
      int m = midPoint();
      if (r <= m)
        {
          String x =
           "Erroneous call to findInsertPointInRight(). "  +
           "rightMostIndex() = " + r +
           ", midPoint() = "     + m + ".";
          throw new OptimisticDepthException(x);
        }
      findIndex(m+1 , r, new1, point);
    }
docs: Find the insert point in the right half of the node for a new key.
  NB: If the node is less than half full then the new key is to
  become the highest key in the node.
  
  @param new1  New Object to be inserted
  @param point Found insertion point