code: public int middleIndex()
    {
      int x = midPoint();
      int r = rightMostIndex();
      if (r < midPoint())
        x = r;
      return x;
    }
docs: Return the index to the key at the median position in the node.