Assertion: tree's key | /r/HasProperty | inserted in the parent
Facets:
Source sentences:
text: The array becomes split by half, so that ⌊( m + j + 1)/2⌋ lowest keys stay in the current node, the next (middle) key is inserted in the parent and the rest go to the right sibling.  
text: The array becomes split by half, so that lowest keys stay in the current node, the next (middle) key is inserted in the parent and the rest go to the right sibling.