Assertion: tree's node | /r/HasProperty | full
Facets:
value: least half
type: DEGREE
Source sentences:
text: U must be either 2L or 2L−1; therefore each internal node is at least half full.
text: This variant ensures non-root nodes are at least 2/3 full instead of 1/2 (Knuth 1998, p. 488).
text: However, if the node is full (it has m − 1 keys, where m is the order of the tree as maximum number of pointers to subtrees from one node), it needs to be checked whether the right sibling exists and has some free space.
text: When both the sibling nodes are full, then the two nodes (current node and a sibling) are split into three and one more key is shifted up the tree, to the parent node.  
text: This variant ensures non-root nodes are at least 2/3 full instead of 1/2 (Knuth 1998, p. 488).
text: However, if the node is full (it has keys, where is the order of the tree as maximum number of pointers to subtrees from one node), it needs to be checked whether the right sibling exists and has some free space.
text: When both the sibling nodes are full, then the two nodes (current node and a sibling) are split into three and one more key is shifted up the tree, to the parent node.
text: In addition, a B-tree minimizes waste by making sure the interior nodes are at least half full.
text: Otherwise the node is full, evenly split it into two nodes so:
text: Because those nodes may also be less than half full, to re-establish the normal B-tree rules, combine such nodes with their (guaranteed full) left siblings and divide the keys to produce two nodes at least half full.